Sciweavers

592 search results - page 68 / 119
» Crossing numbers of random graphs
Sort
View
ICML
2006
IEEE
14 years 8 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 7 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
ECCV
2004
Springer
14 years 1 months ago
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
Leo Grady, Gareth Funka-Lea
BMCBI
2007
127views more  BMCBI 2007»
13 years 8 months ago
Characterization of protein-interaction networks in tumors
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...
MOBICOM
2003
ACM
14 years 1 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas