Sciweavers

3820 search results - page 485 / 764
» Bounded Model Debugging
Sort
View
112
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 1 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
128
Voted
ALT
2005
Springer
16 years 17 days ago
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
Nick Palmer, Paul W. Goldberg
ISQED
2009
IEEE
111views Hardware» more  ISQED 2009»
15 years 10 months ago
Efficient statistical analysis of read timing failures in SRAM circuits
A system-level statistical analysis methodology is described that captures the impact of inter- and intra-die process variations for read timing failures in SRAM circuit blocks. U...
Soner Yaldiz, Umut Arslan, Xin Li, Larry T. Pilegg...
121
Voted
SI3D
2009
ACM
15 years 10 months ago
Real-time view-dependent rendering of parametric surfaces
We propose a view-dependent adaptive subdivision algorithm for rendering parametric surfaces on parallel hardware. Our framework allows us to bound the screen space error of a pie...
Christian Eisenacher, Quirin Meyer, Charles T. Loo...
139
Voted
RECOMB
2009
Springer
15 years 10 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye