Sciweavers

311 search results - page 50 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
CVPR
2010
IEEE
13 years 7 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
CAD
2007
Springer
13 years 7 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 1 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
JAIR
2010
77views more  JAIR 2010»
13 years 6 months ago
Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...
E. H. Durfee Wu, Edmund H. Durfee
INFOCOM
2010
IEEE
13 years 6 months ago
Utility Maximization for Delay Constrained QoS in Wireless
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...
I-Hong Hou, P. R. Kumar