325 search results - page 63 / 65 » Alternatives to two classic data structures |
PPOPP
1997
ACM
15 years 1 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
BMCBI
2008
14 years 9 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
93
Voted
CANDC
2006
ACM
14 years 9 months ago
2006
ACM
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
104
Voted
EDBT
2010
ACM
14 years 8 months ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...