Sciweavers

386 search results - page 33 / 78
» Efficient Parallel Algorithm for Optimal Three-Sequences Ali...
Sort
View
NIPS
2008
13 years 9 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...
DEBS
2009
ACM
13 years 12 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
ICRA
2000
IEEE
136views Robotics» more  ICRA 2000»
14 years 13 days ago
Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm
The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reve...
Jason P. Luck, Charles Q. Little, William Hoff
PPOPP
2009
ACM
14 years 8 months ago
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
Muthu Manikandan Baskaran, Nagavijayalakshmi Vydya...
ECCV
2010
Springer
13 years 8 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani