Sciweavers

2182 search results - page 111 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 5 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
SMA
2003
ACM
125views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Data-dependent fairing of subdivision surfaces
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
Ilja Friedel, Patrick Mullen, Peter Schröder
TON
2010
162views more  TON 2010»
13 years 2 months ago
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
Ritesh Madan, Stephen P. Boyd, Sanjay Lall
EMNLP
2010
13 years 5 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, ...
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 2 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...