Sciweavers

5215 search results - page 634 / 1043
» Quantum clustering algorithms
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
ICSE
2007
IEEE-ACM
16 years 7 months ago
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. I...
Ghassan Misherghi, Lingxiao Jiang, Stéphane...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
16 years 28 days ago
Exploring Group Moving Pattern for an Energy-Constrained Object Tracking Sensor Network
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
Hsiao-Ping Tsai, De-Nian Yang, Wen-Chih Peng, Ming...
182
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
16 years 5 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
RECSYS
2009
ACM
15 years 11 months ago
Effective diverse and obfuscated attacks on model-based recommender systems
Robustness analysis research has shown that conventional memory-based recommender systems are very susceptible to malicious profile-injection attacks. A number of attack models h...
Zunping Cheng, Neil Hurley