Sciweavers

5030 search results - page 933 / 1006
» cases 2007
Sort
View
VLSID
2007
IEEE
154views VLSI» more  VLSID 2007»
16 years 1 months ago
Model Based Test Generation for Microprocessor Architecture Validation
Functional validation of microprocessors is growing in complexity in current and future microprocessors. Traditionally, the different components (or validation collaterals) used i...
Sreekumar V. Kodakara, Deepak Mathaikutty, Ajit Di...
119
Voted
RECOMB
2007
Springer
16 years 1 months ago
Framework for Identifying Common Aberrations in DNA Copy Number Data
High-resolution array comparative genomic hybridization (aCGH) provides exon-level mapping of DNA aberrations in cells or tissues. Such aberrations are central to carcinogenesis an...
Amir Ben-Dor, Doron Lipson, Anya Tsalenko, Mark Re...
91
Voted
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 1 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 1 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
108
Voted
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 1 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans