6395 search results - page 1046 / 1279 » Searching for Interacting Features |
232
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
169
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
158
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
165
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
Law enforcement agencies routinely collect both rolled and plain fingerprints of all the ten fingers of suspects. These two types of fingerprints complement each other, since ro...
276
click to vote
ICS
2007
Tsinghua U.
16 years 23 days ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...