Sciweavers

3571 search results - page 373 / 715
» Cohen and Set Theory
Sort
View
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 7 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
PODS
2007
ACM
131views Database» more  PODS 2007»
16 years 6 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen
ICFP
2008
ACM
16 years 6 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
ICCAD
2007
IEEE
106views Hardware» more  ICCAD 2007»
16 years 3 months ago
A general model for performance optimization of sequential systems
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
Dmitry Bufistov, Jordi Cortadella, Michael Kishine...
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
16 years 3 months ago
Single-Pass Redundancy Addition and Removal
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska