Sciweavers

2638 search results - page 46 / 528
» Random Geometric Complexes
Sort
View
123
Voted
FOCS
1991
IEEE
15 years 6 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
160
Voted
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
16 years 9 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
120
Voted
PAM
2004
Springer
15 years 7 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
117
Voted
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
15 years 4 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
TC
2008
15 years 2 months ago
A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks
This paper presents a new coverage formulation addressing the quality of service of sensor networks that cooperatively detect targets traversing a region of interest. The problem o...
Kelli Baumgartner, Silvia Ferrari