Sciweavers

865 search results - page 29 / 173
» Random graph models for the web graph
Sort
View
ECCV
2004
Springer
14 years 10 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
ACL
2009
13 years 6 months ago
Markov Random Topic Fields
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
Hal Daume III
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...