Sciweavers

2310 search results - page 182 / 462
» Coloring Random Graphs
Sort
View
FSEN
2009
Springer
15 years 9 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 2 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 25 days ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
ICIP
2006
IEEE
16 years 4 months ago
Generation of Long-Term Color and Motion Coherent Partitions
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
Camilo C. Dorea, Ferran Marqués, Montse Par...
ICIP
2009
IEEE
16 years 3 months ago
Visual Tracking Of Object Silhouettes
In this paper we propose a new method that addresses the problem of tracking the bitmap (silhouette) of an object in a video under very general conditions. We assume a general tar...