3466 search results - page 58 / 694 » Fast computation of special resultants |
DAC
1989
ACM
14 years 3 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
ICCV
2011
IEEE
12 years 11 months ago
2011
IEEE
Camera shake leads to non-uniform image blurs. Stateof-the-art methods for removing camera shake model the blur as a linear combination of homographically transformed versions of ...
ICML
2000
IEEE
14 years 12 months ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
CVPR
2007
IEEE
15 years 1 months ago
2007
IEEE
The ability of human visual system to detect visual saliency is extraordinarily fast and reliable. However, computational modeling of this basic intelligent behavior still remains...
DAC
1996
ACM
14 years 3 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...