Sciweavers

1208 search results - page 134 / 242
» Uniform eventown problems
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
DAC
2009
ACM
15 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
DAC
2008
ACM
15 years 11 months ago
Compiler-driven register re-assignment for register file power-density and temperature reduction
Temperature hot-spots have been known to cause severe reliability problems and to significantly increase leakage power. The register file has been previously shown to exhibit the ...
Xiangrong Zhou, Chenjie Yu, Peter Petrov
ICML
1999
IEEE
15 years 10 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ISBI
2008
IEEE
15 years 10 months ago
Improved IDQC reconstruction for inhomogeneity corrected MR spectroscopy
In this paper, we focus on the reconstruction of iDQC MR spectroscopy data. Unlike standard 1-D MR spectroscopy schemes, iDQC acquires 2-D spectral data to decouple the magnetic f...
Rohini Shankar, Tianliang Gu, Jianhui Zhong, Mathe...