Sciweavers

1115 search results - page 73 / 223
» Active Graph Cuts
Sort
View
DAM
2007
78views more  DAM 2007»
15 years 2 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
SIROCCO
2010
15 years 3 months ago
Average Long-Lived Memoryless Consensus: The Three-Value Case
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Ivan Rapaport, Eric Rémila
ICCV
2011
IEEE
14 years 2 months ago
Learning Spatiotemporal Graphs of Human Activities
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
William Brendel, Sinisa Todorovic
146
Voted
COLT
2010
Springer
15 years 14 days 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...
124
Voted
CSCWD
2007
Springer
15 years 8 months ago
An interactive graph visualization for handling cooperative design activity context
The context of a collective activity is characterized by all information produced during the activity. The comprehension of this context by each actor is essential for the success...
Gilles Halin