1591 search results - page 140 / 319 » Random lifts of graphs |
195
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
179
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
156
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
178
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
173
click to vote
TAMC
2009
Springer
16 years 29 days ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...