Sciweavers

129 search results - page 21 / 26
» Lower bounds on power dissipation for DSP algorithms
Sort
View
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 1 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 1 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
COLT
1999
Springer
15 years 1 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
CCS
2003
ACM
15 years 2 months ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis
KI
2008
Springer
14 years 9 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson