Sciweavers

514 search results - page 93 / 103
» Approximate Periods of Strings
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 22 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
HYBRID
2009
Springer
14 years 2 months ago
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
Gunther Reißig
SECON
2008
IEEE
14 years 2 months ago
Optimal Buffer Management Policies for Delay Tolerant Networks
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...