Sciweavers

130 search results - page 19 / 26
» Binary Representations for General CSPs
Sort
View
PLDI
2004
ACM
14 years 2 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren
CAL
2007
13 years 8 months ago
Physical Register Reference Counting
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
A. Roth
TCBB
2008
95views more  TCBB 2008»
13 years 8 months ago
Solving the Problem of Trans-Genomic Query with Alignment Tables
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 9 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
GLOBECOM
2007
IEEE
14 years 3 months ago
Reduced Complexity Sequence Detection of Continuous Phase Modulation Represented as the Linear Superposition of Amplitude Modula
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
Marilynn P. Wylie-Green, Erik Perrins