14078 search results - page 271 / 2816 » Design and Analysis of Computer Algorithms |
175
click to vote
WOB
2003
15 years 8 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
126
click to vote
STACS
2007
Springer
16 years 22 days ago
2007
Springer
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
156
click to vote
ISPD
2006
ACM
16 years 18 days ago
2006
ACM
The existing decoupling capacitance optimization approaches meet constraints on input impedance for package. In this paper, we show that using impedance as constraints leads to la...
169
click to vote
PC
2000
15 years 6 months ago
2000
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
198
click to vote
JAVA
2001
Springer
15 years 11 months ago
2001
Springer
The computational science community is reluctant to write largescale computationally-intensive applications in Java due to concerns over Java’s poor performance, despite the cla...