777 search results - page 36 / 156 » A fast algorithm for the computation of an upper bound on th... |
DC
2008
13 years 7 months ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
APLAS
2010
ACM
13 years 7 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
VTS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...