11211 search results - page 2058 / 2243 » Rank-Sensitive Data Structures |
118
click to vote
OPODIS
2004
15 years 4 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
113
click to vote
ICIS
2003
15 years 4 months ago
2003
ThelinkagesbetweenISandbusinessunitsarerecognizedasbeingcriticaltoinformationsystemsdevelopment processes and outcomes. Previous research has found that they are associated with b...
107
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
115
click to vote
IKE
2003
15 years 4 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 ...
161
click to vote
STRINGOLOGY
2004
15 years 4 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...