Sciweavers

1024 search results - page 120 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 3 months ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
FOCS
2002
IEEE
14 years 1 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
ICRA
2009
IEEE
182views Robotics» more  ICRA 2009»
14 years 3 months ago
Manipulation planning on constraint manifolds
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...