Sciweavers

4110 search results - page 201 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
EMNLP
2010
15 years 4 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
MMAS
2010
Springer
15 years 1 months ago
A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
Dorit Ron, Ilya Safro, Achi Brandt
TWC
2010
15 years 1 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICCV
2003
IEEE
16 years 8 months ago
Efficient, Robust and Accurate Fitting of a 3D Morphable Model
3D Morphable Models, as a means to generate images of a class of objects and to analyze them, have become increasingly popular. The problematic part of this framework is the regis...
Sami Romdhani, Thomas Vetter
ICDCS
1998
IEEE
15 years 10 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen