Sciweavers

2283 search results - page 227 / 457
» Bounds of Graph Characteristics
Sort
View
COLT
2010
Springer
15 years 1 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
146
Voted
IMC
2010
ACM
15 years 1 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
216
Voted
ICALP
2011
Springer
14 years 6 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
107
Voted
CAIP
1999
Springer
180views Image Analysis» more  CAIP 1999»
15 years 7 months ago
A Scale-Space Approach to Face Recognition from Profiles
A method for face recognition using profile images based on the scale-space filtering is presented in this paper. A grey-level image of profile is thresholded to produce a binary, ...
Zdravko Liposcak, Sven Loncaric
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
16 years 5 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother