Sciweavers

15073 search results - page 247 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 10 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
3DOR
2008
15 years 6 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
IPL
2011
91views more  IPL 2011»
14 years 7 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
FOSSACS
2005
Springer
15 years 10 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
JMLR
2010
169views more  JMLR 2010»
14 years 11 months ago
Focused Belief Propagation for Query-Specific Inference
With the increasing popularity of largescale probabilistic graphical models, even "lightweight" approximate inference methods are becoming infeasible. Fortunately, often...
Anton Chechetka, Carlos Guestrin