1092 search results - page 213 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
147
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
161
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We introduce a concept of self-organizing Hybrid Neurofuzzy Networks (HNFN), a hybrid modeling architecture combining neurofuzzy (NF) and polynomial neural networks(PNN)....
183
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
235
Voted
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
181
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...