Sciweavers

1512 search results - page 86 / 303
» Inference Algorithms for Similarity Networks
Sort
View
AAAI
2012
13 years 5 months ago
An Object-Based Bayesian Framework for Top-Down Visual Attention
We introduce a new task-independent framework to model top-down overt visual attention based on graphical models for probabilistic inference and reasoning. We describe a Dynamic B...
Ali Borji, Dicky N. Sihite, Laurent Itti
ADHOC
2008
183views more  ADHOC 2008»
15 years 3 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
ICANN
2001
Springer
15 years 7 months ago
Online Symbolic-Sequence Prediction with Discrete-Time Recurrent Neural Networks
This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the c...
Juan Antonio Pérez-Ortiz, Jorge Calera-Rubi...
HSNMC
2004
Springer
106views Multimedia» more  HSNMC 2004»
15 years 8 months ago
Performance Evaluation of a Probabilistic Packet Filter Optimization Algorithm for High-Speed Network Monitoring
Because of the ever-increasing popularity of the Internet, network monitoring becomes very mission critical to guarantee the operation of IP networks, e.g. to detect network failur...
Jan Coppens, Stijn De Smet, Steven Van den Berghe,...
COMCOM
2007
82views more  COMCOM 2007»
15 years 3 months ago
Jumping ant routing algorithm for sensor networks
Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals – need to ensure they can know the current location of vital but mobi...
Wei-Ming Chen, Chung-Sheng Li, Fu-Yu Chiang, Han-C...