Sciweavers

2079 search results - page 174 / 416
» Universality of random graphs
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 8 months ago
Clustering from Constraint Graphs
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 ...
Ari Freund, Dan Pelleg, Yossi Richter
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Global minimum cuts in surface embedded graphs
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,...
Jeff Erickson, Kyle Fox, Amir Nayyeri

Lecture Notes
2770views
17 years 2 months ago
Lectures on Medical Image Analysis
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...
Tim McGraw
ICML
2009
IEEE
16 years 7 months ago
Graph construction and b-matching for semi-supervised learning
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...
Tony Jebara, Jun Wang, Shih-Fu Chang
GLOBECOM
2009
IEEE
16 years 1 months ago
Multi-Functional Compression with Side Information
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...
Soheil Feizi-Khankandi, Muriel Médard