Sciweavers

2479 search results - page 433 / 496
» Random Event Structures
Sort
View
NIPS
2008
13 years 9 months ago
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
Benjamin Schrauwen, Lars Buesing, Robert A. Legens...
SIROCCO
2008
13 years 9 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
NETWORKING
2007
13 years 9 months ago
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
Benoit Donnet, Bradley Huffaker, Timur Friedman, K...
UAI
2008
13 years 9 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
AAAI
2004
13 years 9 months ago
Reconstruction of 3D Models from Intensity Images and Partial Depth
This paper addresses the probabilistic inference of geometric structures from images. Specifically, of synthesizing range data to enhance the reconstruction of a 3D model of an in...
Luz Abril Torres-Méndez, Gregory Dudek