270 search results - page 29 / 54 » Partitioning into Sets of Bounded Cardinality |
ICS
2010
Tsinghua U.
14 years 26 days ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Given a collection of sets of 2-D views of 3-D objects and a similarity measure between them, we present a method for summarizing the sets using a small subset called a bounded ca...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
SIAMDM
2010
13 years 7 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
EMSOFT
2004
Springer
14 years 2 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...