2412 search results - page 128 / 483 » Which Problems Have Strongly Exponential Complexity |
134
click to vote
PC
2000
15 years 3 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
173
Voted
PROCEDIA
2010
15 years 1 months ago
2010
We describe a new course designed to introduce engineering students to computational thinking. One of the most significant challenges in teaching an introductory-level applied co...
122
Voted
AAAI
2008
15 years 5 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
135
Voted
ICAPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
128
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...