Sciweavers

309 search results - page 46 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 7 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
TON
2008
98views more  TON 2008»
13 years 7 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
ICPR
2004
IEEE
14 years 8 months ago
Robust Carving for Non-Lambertian Objects
This paper presents a new surface reconstruction method that extends previous carving methods for non-Lambertian objects by integrating the smoothness and image information of dif...
Gang Zeng, Sylvain Paris, Long Quan
SCALESPACE
2007
Springer
14 years 1 months ago
Fuzzy Region Competition: A Convex Two-Phase Segmentation Framework
This paper introduces a new framework for two-phase image segmentation, namely the Fuzzy Region Competition. A generic formulation is developed that extends in a convex way several...
Benoit Mory, Roberto Ardon
INFOCOM
2005
IEEE
14 years 1 months ago
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput
— We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations th...
Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang