Sciweavers

CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
CORR
2010
Springer
63views Education» more  CORR 2010»
13 years 7 months ago
XQ2P: Efficient XQuery P2P Time Series Processing
In this demonstration, we propose a model for the management of XML time series (TS), using the new XQuery
Bogdan Butnaru, Benjamin Nguyen, Georges Gardarin,...
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 7 months ago
Controlled non uniform random generation of decomposable structures
Alain Denise, Yann Ponty, Michel Termier
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Adaptive Demodulation in Differentially Coherent Phase Systems: Design and Performance Analysis
Adaptive Demodulation (ADM) is a newly proposed rate-adaptive system which operates without requiring Channel State Information (CSI) at the transmitter (unlike adaptive modulatio...
J. David Brown, Jamshid Abouei, Konstantinos N. Pl...
CORR
2010
Springer
48views Education» more  CORR 2010»
13 years 7 months ago
An Implicit Characterization of PSPACE
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Learning Probabilistic Hierarchical Task Networks to Capture User Preferences
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Methods for the Reconstruction of Parallel Turbo Codes
Abstract--We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo c...
Mathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Til...
CORR
2010
Springer
202views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...