146 search results - page 9 / 30 » Cyclic reference counting |
162
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
171
click to vote
IWMM
2000
Springer
15 years 10 months ago
2000
Springer
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program s...
148
click to vote
CC
2007
Springer
16 years 18 days ago
2007
Springer
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...
131
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...
162
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...