Sciweavers

545 search results - page 100 / 109
» Estimating the Probability of Approximate Matches
Sort
View
JCNS
1998
134views more  JCNS 1998»
13 years 7 months ago
Analytical and Simulation Results for Stochastic Fitzhugh-Nagumo Neurons and Neural Networks
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...
Henry C. Tuckwell, Roger Rodriguez
TMC
2012
11 years 9 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
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...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 20 days ago
Optimality, scalability and stability study of partitioning and placement algorithms
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...
Jason Cong, Michail Romesis, Min Xie
NIPS
1990
13 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
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...
Stephen M. Omohundro
JAIR
2008
93views more  JAIR 2008»
13 years 7 months ago
A Rigorously Bayesian Beam Model and an Adaptive Full Scan Model for Range Finders in Dynamic Environments
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...
Tinne De Laet, Joris De Schutter, Herman Bruyninck...