Sciweavers

374 search results - page 26 / 75
» Stochastic Minority on Graphs
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
CAV
2009
Springer
168views Hardware» more  CAV 2009»
14 years 4 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
Thomas Gawlitza, Helmut Seidl
CVPR
1999
IEEE
14 years 11 months ago
Stochastic Image Segmentation by Typical Cuts
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
Yoram Gdalyahu, Daphna Weinshall, Michael Werman
ICDM
2007
IEEE
156views Data Mining» more  ICDM 2007»
14 years 1 months ago
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
Tsuyoshi Idé, Spiros Papadimitriou, Michail...
DCC
2008
IEEE
14 years 4 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson