582 search results - page 9 / 117 » Analysis of Grain's Initialization Algorithm |
108
Voted
CDC
2009
IEEE
15 years 4 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
15 years 9 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...
108
click to vote
EACL
2006
ACL Anthology
15 years 4 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...
145
Voted
PPSN
2010
Springer
15 years 23 days 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:...
136
click to vote
PPOPP
2012
ACM
13 years 10 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...