12 search results - page 2 / 3 » Simple summaries for hashing with choices |
AIRS
2004
Springer
13 years 10 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
SIGCOMM
2004
ACM
13 years 10 months ago
2004
ACM
We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building bloc...
EDBT
2002
ACM
14 years 5 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
BMCBI
2010
13 years 5 months ago
2010
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...