Sciweavers

1142 search results - page 81 / 229
» Approximability of Clausal Constraints
Sort
View
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 6 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 6 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
FOCS
2006
IEEE
16 years 13 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
IFIPTCS
2010
15 years 4 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...