Sciweavers

963 search results - page 84 / 193
» On the decomposition of rational functions
Sort
View
SIAMJO
2011
13 years 3 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
ICCV
2009
IEEE
15 years 1 months ago
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
14 years 9 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
14 years 2 months ago
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
George Labahn, Ziming Li
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 2 months ago
Multi-Agent Systems and Microeconomic Theory: A Negotiation Approach to Solve Scheduling Problems in High Dynamic Environments
Microeconomics offer a far developed theory on the subject of rational choice. This theory is applied to a multi-agent system, which has been modeled in order to establish schedul...
Hans Czap, Marc Becker