Sciweavers

102 search results - page 5 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
CDC
2009
IEEE
200views Control Systems» more  CDC 2009»
14 years 6 days ago
Control of nonlinear systems with full state constraint using a Barrier Lyapunov Function
— This paper presents a control for state-constrained nonlinear systems in strict feedback form to achieve output tracking. To prevent states from violating the constraints, we e...
Keng Peng Tee, Shuzhi Sam Ge
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
STACS
2001
Springer
13 years 12 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 8 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam