Sciweavers

1431 search results - page 66 / 287
» The complexity of random ordered structures
Sort
View
EJC
2007
15 years 3 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
CVPR
2010
IEEE
15 years 6 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
BC
2002
193views more  BC 2002»
15 years 2 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon
TIT
2010
143views Education» more  TIT 2010»
14 years 9 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 3 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...