921 search results - page 15 / 185 » New Data Structures for Orthogonal Range Searching |
118
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
264
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
109
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...
150
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
123
Voted
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...