Sciweavers

2746 search results - page 27 / 550
» Bisubmodular Function Minimization
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 5 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
CIE
2010
Springer
15 years 6 months ago
The Peirce Translation and the Double Negation Shift
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
Martín Hötzel Escardó, Paulo Ol...
ICCAD
2004
IEEE
150views Hardware» more  ICCAD 2004»
15 years 10 months ago
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
Maxim Teslenko, Elena Dubrova
3DIM
2007
IEEE
15 years 8 months ago
Outlier Robust ICP for Minimizing Fractional RMSD
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms...
Jeff M. Phillips, Ran Liu, Carlo Tomasi
ECML
2007
Springer
15 years 8 months ago
On Minimizing the Position Error in Label Ranking
Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem ...
Eyke Hüllermeier, Johannes Fürnkranz