1977 search results - page 24 / 396 » The satisfactory partition problem |
180
click to vote
KDD
2001
ACM
16 years 6 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
150
click to vote
AIIA
2009
Springer
16 years 11 days ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
143
click to vote
PC
2000
15 years 5 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
166
click to vote
JCO
2008
15 years 5 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
149
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...