Sciweavers

2392 search results - page 348 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 1 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ATAL
2007
Springer
16 years 20 days ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 12 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
CVPR
2006
IEEE
16 years 8 months ago
Efficient Maximally Stable Extremal Region (MSER) Tracking
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...
Michael Donoser, Horst Bischof
ICML
2009
IEEE
16 years 7 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon