Sciweavers

321 search results - page 33 / 65
» A view selection algorithm with performance guarantee
Sort
View
COLT
2005
Springer
15 years 4 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
JMLR
2006
145views more  JMLR 2006»
14 years 11 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
15 years 8 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
SCIA
2007
Springer
149views Image Analysis» more  SCIA 2007»
15 years 5 months ago
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
Klas Josephson, Fredrik Kahl
ML
2006
ACM
14 years 11 months ago
Type-sensitive control-flow analysis
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
John H. Reppy