Sciweavers

2192 search results - page 94 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IROS
2007
IEEE
116views Robotics» more  IROS 2007»
14 years 2 months ago
Optimal distributed planning of multi-robot placement on a 3D truss
— 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...
Seung-kook Yun, Daniela Rus
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
13 years 12 months ago
Generic Entity Resolution with Data Confidences
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 ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
CVPR
2009
IEEE
15 years 3 months ago
Higher-Order Clique Reduction in Binary Graph Cut
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...
Hiroshi Ishikawa 0002
ICCVW
1999
Springer
14 years 14 days ago
Generalized Voxel Coloring
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...
W. Bruce Culbertson, Thomas Malzbender, Gregory G....
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 1 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
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 ...
André Leier, Wolfgang Banzhaf