4541 search results - page 557 / 909 » Cache-Oblivious Algorithms and Data Structures |
213
click to vote
SIGIR
2006
ACM
16 years 1 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
196
click to vote
KDD
2005
ACM
16 years 17 days ago
2005
ACM
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
253
click to vote
CPM
2004
Springer
16 years 14 days ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
249
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
210
click to vote
COMPGEOM
2004
ACM
16 years 15 days ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...