3897 search results - page 122 / 780 » complexity 2010 |
109
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
PPL
2010
15 years 28 days ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
120
Voted
TCOM
2010
14 years 9 months ago
2010
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
127
click to vote
JCIT
2010
14 years 9 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...