357 search results - page 26 / 72 » Fast Hypergraph Partition |
INFFUS
2008
13 years 7 months ago
2008
act 11 We describe an ensemble approach to learning from arbitrarily partitioned data. The partitioning comes from the distributed process12 ing requirements of a large scale simul...
ICS
2010
Tsinghua U.
13 years 11 months 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...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a fast algorithm for face detection and precise pose estimation. Our detection scheme is based on a tree-structured hierarchy of face vs. background classifiers combine...