Sciweavers

4248 search results - page 357 / 850
» Simulating hci for all
Sort
View
DCC
2008
IEEE
16 years 7 months ago
Improved versions of Tardos' fingerprinting scheme
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
Oded Blayer, Tamir Tassa
190
Voted
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 5 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
16 years 4 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
ICML
2009
IEEE
16 years 2 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
191
Voted
DATE
2009
IEEE
103views Hardware» more  DATE 2009»
16 years 2 months ago
Masking timing errors on speed-paths in logic circuits
There is a growing concern about timing errors resulting from design marginalities and the effects of circuit aging on speed-paths in logic circuits. This paper presents a low ove...
Mihir R. Choudhury, Kartik Mohanram