32545 search results - page 318 / 6509 » Data Structures and Algorithms |
202
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
224
click to vote
WIA
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
169
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
163
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
180
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...