4198 search results - page 195 / 840 » In search of lost time |
148
click to vote
PR
2007
15 years 6 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
171
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
151
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
178
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
136
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— Consider the task of searching a region for the presence or absence of a target using a team of multiple searchers. This paper formulates this search problem as a sequential pr...