2899 search results - page 125 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
122
Voted
IJCAI
1989
15 years 2 months ago
1989
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
ISPD
2003
ACM
15 years 6 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
109
Voted
SC
2000
ACM
15 years 6 months ago
2000
ACM
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
106
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
113
Voted
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...