2192 search results - page 94 / 439 » Algorithms for Challenging Motif Problems |
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper considers the problem of allocating tasks among robots that operate on a 3D truss. Each robot is commanded to navigate to a different location for work. When the inf...
128
Voted
CLEANDB
2006
ACM
15 years 7 months ago
2006
ACM
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
157
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
126
Voted
ICCVW
1999
Springer
15 years 8 months ago
1999
Springer
Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...
154
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...