Sciweavers

16257 search results - page 3002 / 3252
» D-finiteness: algorithms and applications
Sort
View
DCOSS
2008
Springer
15 years 8 months ago
Automatic Collection of Fuel Prices from a Network of Mobile Cameras
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
Y. F. Dong, Salil S. Kanhere, Chun Tung Chou, Niru...
ESOP
2008
Springer
15 years 8 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
FMSB
2008
199views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 8 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 8 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
« Prev « First page 3002 / 3252 Last » Next »