Sciweavers

3420 search results - page 10 / 684
» Proximity Search in Databases
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
PATAT
2004
Springer
141views Education» more  PATAT 2004»
14 years 26 days ago
A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
Pascal Côté, Tony Wong, Robert Sabour...
ICDE
2010
IEEE
194views Database» more  ICDE 2010»
14 years 7 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
PAMI
2006
164views more  PAMI 2006»
13 years 7 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 3 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...