Sciweavers

519 search results - page 14 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
14 years 11 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
ICLP
2004
Springer
15 years 6 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
120
Voted
IPMI
2007
Springer
16 years 2 months ago
Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
Ben Glocker, Nikos Komodakis, Nikos Paragios, Geor...
CDC
2010
IEEE
14 years 8 months ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh
COCOA
2007
Springer
15 years 7 months ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman