Sciweavers

4007 search results - page 217 / 802
» Computation with imprecise probabilities
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 5 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
FUIN
2008
112views more  FUIN 2008»
15 years 4 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins
CIKM
2010
Springer
15 years 2 months ago
Skyline query processing for uncertain data
Recently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over un...
Mohamed E. Khalefa, Mohamed F. Mokbel, Justin J. L...
146
Voted
SIAMSC
2010
165views more  SIAMSC 2010»
15 years 2 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...