582 search results - page 9 / 117 » Analysis of Grain's Initialization Algorithm |
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Recently, we proposed a model for the steady-state estimation error of real-valued constant-modulus-based algorithms as a function of the a priori error and of a term that measure...
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
Probabilistic Latent Semantic Analysis (PLSA) models have been shown to provide a better model for capturing polysemy and synonymy than Latent Semantic Analysis (LSA). However, th...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...