4972 search results - page 85 / 995 » Ranking on graph data |
104
click to vote
TSP
2008
15 years 4 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
116
click to vote
COLING
2010
14 years 11 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
141
click to vote
IOR
2011
14 years 11 months ago
2011
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
136
Voted
INLG
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents an easy-to-adapt, discourse-aware framework that can be utilized as the content selection component of a generation system whose goal is to deliver descriptive...
127
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...