Sciweavers

1604 search results - page 247 / 321
» Approximation algorithms for developable surfaces
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 1 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
NECO
2007
127views more  NECO 2007»
15 years 29 days ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
15 years 7 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
POPL
2007
ACM
16 years 1 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ICCV
2003
IEEE
16 years 3 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...