279 search results - page 47 / 56 » Methods for finding frequent items in data streams |
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
WAIM
2004
Springer
14 years 1 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
IDEAL
2010
Springer
13 years 5 months ago
2010
Springer
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...
GIS
2008
ACM
14 years 8 months ago
2008
ACM
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...