Sciweavers

344 search results - page 64 / 69
» Random Walks on Colored Graphs
Sort
View
AAAI
2007
13 years 10 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
ASUNAM
2010
IEEE
13 years 9 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen
AAAI
2010
13 years 9 months ago
Diversifying Query Suggestion Results
In order to improve the user search experience, Query Suggestion, a technique for generating alternative queries to Web users, has become an indispensable feature for commercial s...
Hao Ma, Michael R. Lyu, Irwin King
ICASSP
2011
IEEE
12 years 11 months ago
Improved spoken term detection with graph-based re-ranking in feature space
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
Yun-Nung Chen, Chia-Ping Chen, Hung-yi Lee, Chun-a...
SPAA
2006
ACM
14 years 1 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...