Sciweavers

2292 search results - page 60 / 459
» Hierarchical approximation and localization
Sort
View
CVPR
2004
IEEE
16 years 6 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SENSYS
2004
ACM
15 years 9 months ago
Using hierarchical location names for scalable routing and rendezvous in wireless sensor networks
Until practical ad-hoc localization systems are developed, early deployments of wireless sensor networks will manually configure location information in network nodes in order to...
Fang Bian, Ramesh Govindan, Scott Shenker, Xin Li
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 8 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
EDBT
2006
ACM
190views Database» more  EDBT 2006»
16 years 4 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
CVPR
2006
IEEE
16 years 6 months ago
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik S...