4342 search results - page 250 / 869 » Improved Algorithms for Optimal Embeddings |
143
click to vote
SWAT
2004
Springer
15 years 11 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...
153
click to vote
ICML
2007
IEEE
16 years 6 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...
156
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
203
Voted
EDBT
1998
ACM
15 years 9 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
173
click to vote
ASPLOS
2011
ACM
14 years 9 months ago
2011
ACM
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...