22018 search results - page 4321 / 4404 » or 2004 |
145
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
160
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
149
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
131
click to vote
TREC
2004
15 years 7 months ago
2004
The text-mining system we are building deals with the specific problem of identifying the instances of relevant concepts present in the texts. Therefore, our system relies on inte...
168
click to vote
TREC
2004
15 years 7 months ago
2004
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...