Sciweavers

5595 search results - page 476 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
EUROSYS
2010
ACM
16 years 4 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
16 years 1 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
ACMSE
2004
ACM
16 years 1 months ago
Topic-based clustering of news articles
Recent years have witnessed an explosion in the availability of news articles on the World Wide Web. Although searchengines’ algorithms have made it easier to locate these docum...
Najaf Ali Shah, Ehab M. ElBahesh
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 7 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
SIAMJO
2010
136views more  SIAMJO 2010»
15 years 2 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López