462 search results - page 91 / 93 » Symbolic Bounded Synthesis |
165
click to vote
ALT
1995
Springer
15 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
155
click to vote
TIT
2008
15 years 5 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
127
Voted
TIT
2002
15 years 5 months ago
2002
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
158
click to vote
USS
2010
15 years 3 months ago
2010
Idle port scanning uses side-channel attacks to bounce scans off of a "zombie" host to stealthily scan a victim IP address and determine if a port is open or closed, or ...
155
Voted
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...