Sciweavers

993 search results - page 80 / 199
» The Complexity of Probabilistic EL
Sort
View
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
13 years 12 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara
AAAI
1994
13 years 9 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
PERCOM
2010
ACM
13 years 6 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
IPL
2011
91views more  IPL 2011»
12 years 11 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...
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...