1951 search results - page 311 / 391 » An algorithm for improving graph partitions |
151
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
175
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
127
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
323
click to vote
PAMI
2010
15 years 2 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
140
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...