Sciweavers

13376 search results - page 331 / 2676
» Problem Solving with
Sort
View
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 8 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
319
Voted
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 5 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
15 years 10 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl
ICIP
2009
IEEE
16 years 5 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini