Sciweavers

605 search results - page 93 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
IJON
2008
121views more  IJON 2008»
13 years 9 months ago
Locality sensitive semi-supervised feature selection
In many computer vision tasks like face recognition and image retrieval, one is often confronted with high-dimensional data. Procedures that are analytically or computationally ma...
Jidong Zhao, Ke Lu, Xiaofei He
JDA
2008
72views more  JDA 2008»
13 years 9 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
PAMI
2007
197views more  PAMI 2007»
13 years 9 months ago
A Lattice-Based MRF Model for Dynamic Near-Regular Texture Tracking
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
Wen-Chieh Lin, Yanxi Liu
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 8 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
PAMI
2012
12 years 1 days ago
Exploring Context and Content Links in Social Media: A Latent Space Method
—Social media networks contain both content and context-specific information. Most existing methods work with either of the two for the purpose of multimedia mining and retrieva...
Guo-Jun Qi, Charu C. Aggarwal, Qi Tian, Heng Ji, T...