Sciweavers

1591 search results - page 285 / 319
» Random lifts of graphs
Sort
View
AAAI
2007
15 years 5 days 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
PODC
2010
ACM
14 years 11 months ago
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
Bo Tan, Laurent Massoulié
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
14 years 11 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ASUNAM
2010
IEEE
14 years 11 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