32545 search results - page 591 / 6509 » Data Structures and Algorithms |
246
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
162
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
— New GNSS signals are usually characterized by the presence of secondary codes and high data rates that can make the sign of the transmitted signal change each primary code peri...
157
click to vote
PAKDD
2004
ACM
16 years 19 days ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
158
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
197
Voted
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...