Sciweavers

1115 search results - page 137 / 223
» Active Graph Cuts
Sort
View
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ATAL
2010
Springer
13 years 9 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
RPTEL
2006
75views more  RPTEL 2006»
13 years 8 months ago
A Qualitative Analysis of Collaborative Knowledge Construction through Shared Representations
This paper takes one step towards addressing the question of how activity mediated by shared representations--notations that are manipulated by more than one person during a collab...
Daniel D. Suthers
SAC
2002
ACM
13 years 7 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...