Sciweavers

1689 search results - page 10 / 338
» Proximate point searching
Sort
View
PAMI
2006
164views more  PAMI 2006»
13 years 9 months ago
Adaptive Support-Weight Approach for Correspondence Search
We present a new window-based method for correspondence search using varying support-weights. We adjust the support-weights of the pixels in a given support window based on color s...
Kuk-Jin Yoon, In-So Kweon
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 5 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
13 years 9 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
ICDE
2010
IEEE
194views Database» more  ICDE 2010»
14 years 9 months ago
XColor: Protecting General Proximity Privacy
As a severe threat in anonymized data publication, proximity breach is gaining increasing attention. Such breach occurs when an attacker learns with high confidence that the sensit...
Ting Wang, Ling Liu
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
14 years 4 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala