Sciweavers

286 search results - page 37 / 58
» A Markov Chain Model of the B-Cell Algorithm
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Contour Grouping Based on Local Symmetry
The paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the M...
Nagesh Adluru, Longin Jan Latecki, Rolf Lakäm...
ILP
2007
Springer
14 years 1 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...
CVPR
2009
IEEE
14 years 2 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan
INFOCOM
2009
IEEE
14 years 2 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
DKE
2007
130views more  DKE 2007»
13 years 7 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan