Sciweavers

4451 search results - page 673 / 891
» On Random Ordering Constraints
Sort
View
NECO
2010
147views more  NECO 2010»
15 years 5 months ago
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
Lars Büsing, Benjamin Schrauwen, Robert A. Le...
PODC
2010
ACM
15 years 4 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
PVLDB
2010
149views more  PVLDB 2010»
15 years 4 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
PVLDB
2010
84views more  PVLDB 2010»
15 years 4 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
VTC
2010
IEEE
172views Communications» more  VTC 2010»
15 years 4 months ago
Turbo Source Compression with Jointly Optimized Inner Irregular and Outer Irregular Codes
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
Laurent Schmalen, Peter Vary, Thorsten Clevorn, Ma...