Sciweavers

18306 search results - page 3433 / 3662
» Algorithmics in Exponential Time
Sort
View
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
15 years 4 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
ATAL
2008
Springer
15 years 4 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
CIKM
2008
Springer
15 years 4 months ago
SNIF TOOL: sniffing for patterns in continuous streams
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
Abhishek Mukherji, Elke A. Rundensteiner, David C....
CASES
2005
ACM
15 years 4 months ago
Optimizing stream programs using linear state space analysis
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
Sitij Agrawal, William Thies, Saman P. Amarasinghe
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 4 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
« Prev « First page 3433 / 3662 Last » Next »