Sciweavers

50 search results - page 3 / 10
» Lagrange Multiplier Method for Multi-campaign Assignment Pro...
Sort
View
SIAMCO
2010
153views more  SIAMCO 2010»
13 years 15 days ago
Optimal Control for an Elliptic System with Polygonal State Constraints
This work is devoted to stationary optimal control problems with polygonal constraints on the components of the state. Existence of Lagrange multipliers, of different regularity, i...
Karl Kunisch, Kewei Liang, Xiliang Lu
TIP
1998
114views more  TIP 1998»
13 years 5 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
NECO
2008
108views more  NECO 2008»
13 years 5 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer
INFOCOM
2011
IEEE
12 years 9 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
SIAMNUM
2011
108views more  SIAMNUM 2011»
13 years 21 days ago
A Mixed Method for the Biharmonic Problem Based On a System of First-Order Equations
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...
Edwin M. Behrens, Johnny Guzmán