Sciweavers

9267 search results - page 1792 / 1854
» Expectation-Oriented Analysis and Design
Sort
View
POPL
2006
ACM
14 years 8 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
POPL
2003
ACM
14 years 8 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
RECOMB
2002
Springer
14 years 8 months ago
Inferring Piecewise Ancestral History from Haploid Sequences
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
Russell Schwartz, Andrew G. Clark, Sorin Istrail
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 8 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
« Prev « First page 1792 / 1854 Last » Next »