Sciweavers

459 search results - page 23 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
JMLR
2010
111views more  JMLR 2010»
14 years 6 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
CMSB
2009
Springer
15 years 6 months ago
Probabilistic Approximations of Signaling Pathway Dynamics
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
Bing Liu, P. S. Thiagarajan, David Hsu
110
Voted
CVPR
2003
IEEE
16 years 1 months ago
Recognising and Monitoring High-Level Behaviours in Complex Spatial Environments
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
Nam Thanh Nguyen, Hung Hai Bui, Svetha Venkatesh, ...
JCST
2010
189views more  JCST 2010»
14 years 6 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ATAL
2009
Springer
15 years 6 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham