3223 search results - page 249 / 645 » The Scaling of Search Cost |
189
click to vote
CRV
2008
IEEE
16 years 1 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
174
click to vote
WMASH
2003
ACM
15 years 12 months ago
2003
ACM
To be widely adopted, location-aware computing must be as effortless, familiar and rewarding as web search tools like Google. We envisage the global scale Place Lab, consisting of...
196
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
246
click to vote
SIGCOMM
1997
ACM
15 years 10 months ago
1997
ACM
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
154
click to vote
LREC
2008
15 years 8 months ago
2008
The National Institute of Information and Communications Technology (NICT) and Nagoya University have been jointly constructing a large scale database named SHACHI by collecting d...