545 search results - page 100 / 109 » Estimating the Probability of Approximate Matches |
128
Voted
JCNS
1998
15 years 8 days ago
1998
An analytical approach is presented for determining the response of a neuron or of the activity in a network of connected neurons, represented by systems of nonlinear ordinary stoc...
128
click to vote
TMC
2012
13 years 3 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
102
click to vote
ISPD
2003
ACM
15 years 5 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
120
click to vote
NIPS
1990
15 years 1 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
112
Voted
JAIR
2008
15 years 18 days ago
2008
This paper proposes and experimentally validates a Bayesian network model of a range finder adapted to dynamic environments. All modeling assumptions are rigorously explained, and...