Sciweavers

3250 search results - page 129 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICCAD
2009
IEEE
154views Hardware» more  ICCAD 2009»
15 years 2 months ago
Pad assignment for die-stacking System-in-Package design
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
Yu-Chen Lin, Wai-Kei Mak, Chris Chu, Ting-Chi Wang
PAMI
2011
15 years 18 hour ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
CCCG
2010
15 years 6 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
EUROCOLT
1999
Springer
15 years 9 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
139
Voted
CORR
2006
Springer
83views Education» more  CORR 2006»
15 years 5 months ago
Fast linear algebra is stable
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
James Demmel, Ioana Dumitriu, Olga Holtz