1,869 research outputs found
A technique for adding range restrictions to generalized searching problems
In a generalized searching problem, a set of colored geometric objects has to be stored in a data structure, such that for any given query object , the distinct colors of the objects of intersected by can be reported efficiently. In this paper, a general technique is presented for adding a range restriction to such a problem. The technique is applied to the problem of querying a set of colored points (resp.\ fat triangles) with a fat triangle (resp.\ point). For both problems, a data structure is obtained having size and query time . Here, denotes the number of colors reported by the query, and is an arbitrarily small positive constant
Sampling decomposable graphs using a Markov chain on junction trees
Full Bayesian computational inference for model determination in undirected
graphical models is currently restricted to decomposable graphs, except for
problems of very small scale. In this paper we develop new, more efficient
methodology for such inference, by making two contributions to the
computational geometry of decomposable graphs. The first of these provides
sufficient conditions under which it is possible to completely connect two
disconnected complete subsets of vertices, or perform the reverse procedure,
yet maintain decomposability of the graph. The second is a new Markov chain
Monte Carlo sampler for arbitrary positive distributions on decomposable
graphs, taking a junction tree representing the graph as its state variable.
The resulting methodology is illustrated with numerical experiments on three
specific models.Comment: 22 pages, 7 figures, 1 table. V2 as V1 except that Fig 1 was
corrected. V3 has significant edits, dropping some figures and including
additional examples and a discussion of the non-decomposable case. V4 is
further edited following review, and includes additional reference
Recommended from our members
Data structures for retrieval on integer grids
A family of data structures is presented for retrieval of the sum of values of points within a half-plane or polygon, given that the points are on integer coordinates in the plane. Fredman has shown that the problem has a lower bound of Ω(N^2/3) for intermixed updates and retrievals. Willard has shown an upper bound of O(N^2log6^4) for the case where the points are not restricted to integer coordinates.We have developed families of related data structures for retrievals of half-planes or polygons. One of the data structures permits intermixed updates and half-plane retrievals in O(N^2/3log N) time, where N is the size of the grid.We use a technique we call "Rotation" to permit a better match of a portion of the data structure to the particular problem. Rotations appear to be an effective method for trading-off storage redundancy against retrieval time for certain classes of problems
A complete family of separability criteria
We introduce a new family of separability criteria that are based on the
existence of extensions of a bipartite quantum state to a larger number
of parties satisfying certain symmetry properties. It can be easily shown that
all separable states have the required extensions, so the non-existence of such
an extension for a particular state implies that the state is entangled. One of
the main advantages of this approach is that searching for the extension can be
cast as a convex optimization problem known as a semidefinite program (SDP).
Whenever an extension does not exist, the dual optimization constructs an
explicit entanglement witness for the particular state. These separability
tests can be ordered in a hierarchical structure whose first step corresponds
to the well-known Positive Partial Transpose (Peres-Horodecki) criterion, and
each test in the hierarchy is at least as powerful as the preceding one. This
hierarchy is complete, in the sense that any entangled state is guaranteed to
fail a test at some finite point in the hierarchy, thus showing it is
entangled. The entanglement witnesses corresponding to each step of the
hierarchy have well-defined and very interesting algebraic properties that in
turn allow for a characterization of the interior of the set of positive maps.
Coupled with some recent results on the computational complexity of the
separability problem, which has been shown to be NP-hard, this hierarchy of
tests gives a complete and also computationally and theoretically appealing
characterization of mixed bipartite entangled states.Comment: 21 pages. Expanded introduction. References added, typos corrected.
Accepted for publication in Physical Review
- âŠ