Sciweavers

774 search results - page 81 / 155
» Markov incremental constructions
Sort
View
AAAI
2008
13 years 11 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 4 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
ICML
1999
IEEE
14 years 10 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
CVPR
2005
IEEE
14 years 11 months ago
Online Learning of Probabilistic Appearance Manifolds for Video-Based Recognition and Tracking
This paper presents an online learning algorithm to construct from video sequences an image-based representation that is useful for recognition and tracking. For a class of object...
Kuang-Chih Lee, David J. Kriegman
WECWIS
2003
IEEE
82views ECommerce» more  WECWIS 2003»
14 years 2 months ago
Property Propagation Rules for Prioritizing and Synchronizing Trading Activities
With the growing number of marketplaces and trading partners in the e–commerce environment, software tools designed to act on behalf of human traders are increasingly used to au...
Yain-Whar Si, David Edmond, Arthur H. M. ter Hofst...