Sciweavers

15073 search results - page 30 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
76
Voted
WCNC
2010
IEEE
15 years 1 months ago
Deploying Wireless Sensors for Differentiated Coverage and Probabilistic Connectivity
—The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elit...
Yanjun Li, Ye-Qiong Song, Yi-hua Zhu, René ...
76
Voted
UAI
2004
14 years 11 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
79
Voted
ECCV
2004
Springer
15 years 3 months ago
A Probabilistic Approach to Large Displacement Optical Flow and Occlusion Detection
This paper deals with the computation of optical flow and occlusion detection in the case of large displacements. We propose a Bayesian approach to the optical flow problem and s...
Christoph Strecha, Rik Fransens, Luc J. Van Gool
MFCS
2007
Springer
15 years 3 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner