Sciweavers

1249 search results - page 35 / 250
» Limitations of the Even-Mansour Construction
Sort
View
INFOCOM
2011
IEEE
14 years 3 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
IJCAI
1989
15 years 1 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
LICS
2010
IEEE
14 years 10 months ago
Polarity and the Logic of Delimited Continuations
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Noam Zeilberger
TIT
1998
105views more  TIT 1998»
14 years 11 months ago
Diversity Waveform Sets for Delay-Doppler Imaging
Abstract— Properties of the ambiguity function and the uncertainty relation of Fourier transforms assert fundamental limitations on the ability of any single radar waveform of co...
Jiann-Ching Guey, Mark R. Bell
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 10 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari