Sciweavers

84 search results - page 12 / 17
» A Constant Factor Approximation Algorithm for Generalized Mi...
Sort
View
COMPGEOM
1996
ACM
13 years 11 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 7 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 8 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
ESWS
2007
Springer
14 years 1 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann