Sciweavers

183 search results - page 11 / 37
» Analyzing graph structure via linear measurements
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 1 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CIKM
2008
Springer
15 years 7 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
CSL
2011
Springer
15 years 24 days ago
Applications of graph theory to an English rhyming corpus
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
Morgan Sonderegger
AI
2011
Springer
15 years 25 days ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
ICCV
2009
IEEE
16 years 10 months ago
Sparsity Induced Similarity Measure for Label Propagation
Graph-based semi-supervised learning has gained considerable interests in the past several years thanks to its effectiveness in combining labeled and unlabeled data through labe...
Hong Cheng, Zicheng Liu, Jie Yang