9209 search results - page 382 / 1842 » Data Space Randomization |
222
click to vote
ICALP
1991
Springer
15 years 10 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
167
Voted
IKE
2003
15 years 8 months ago
2003
Many information retrieval systems use the inverted file as indexing structure. The inverted file, however, is not suited to supporting incremental updates when new documents are ...
195
Voted
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
199
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
145
click to vote
IJBRA
2007
15 years 6 months ago
2007
Abstract: High-throughput array-based assays have recently been developed to detect DNA copy number (DCN) aberrations. The DCN data from these arrays is characterized by high level...