Sciweavers

822 search results - page 104 / 165
» Descendants in Increasing Trees
Sort
View
CVPR
1997
IEEE
15 years 12 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
GIS
2007
ACM
15 years 11 months ago
Recognizing cars in aerial imagery to improve orthophotos
The automatic creation of 3D models of urban spaces has become a very active field of research. This has been inspired by recent applications in the location-awareness on the Inte...
Franz Leberl, Horst Bischof, Helmut Grabner, Stefa...
SIGSOFT
2007
ACM
15 years 10 months ago
Towards incremental adaptive covering arrays
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
Adam A. Porter, Myra B. Cohen, Sandro Fouché...
VLSID
2005
IEEE
87views VLSI» more  VLSID 2005»
15 years 10 months ago
Synthesis of Asynchronous Circuits Using Early Data Validity
Interest in asynchronous circuit design is increasing due to its promise of efficient designs. The quiescent nature of asynchronous circuits allows them to remain in a stable stat...
Nitin Gupta, Doug A. Edwards
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
15 years 10 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup