Sciweavers

2898 search results - page 157 / 580
» Robust Algorithms for Object Localization
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
CVPR
2003
IEEE
14 years 11 months ago
Multi-scale Phase-based Local Features
Local feature methods suitable for image feature based object recognition and for the estimation of motion and structure are composed of two steps, namely the `where' and `wh...
Gustavo Carneiro, Allan D. Jepson
DAC
2006
ACM
14 years 10 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
TOG
1998
98views more  TOG 1998»
13 years 8 months ago
V-Clip: Fast and Robust Polyhedral Collision Detection
This paper presents the Voronoi-clip, or V-clip, collision detection algorithm for polyhedral objects specified by a boundary representation. V-clip tracks the closest pair of fe...
Brian Mirtich
SMA
2009
ACM
228views Solid Modeling» more  SMA 2009»
14 years 3 months ago
Robust mesh reconstruction from unoriented noisy points
We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps. Firstly, the normal vectors at points...
Hoi Sheung, Charlie C. L. Wang