Sciweavers

4926 search results - page 242 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
147
Voted
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 11 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
FOCS
2009
IEEE
16 years 1 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ICASSP
2011
IEEE
14 years 10 months ago
Discriminative simplification of mixture models
Simplification of mixture models has recently emerged as an important issue in the field of statistical learning. The heavy computational demands of using large order models dro...
Yossi Bar-Yosef, Yuval Bistritz
AAAI
2004
15 years 7 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...