Sciweavers

5595 search results - page 434 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 7 months ago
Data Stream Clustering: Challenges and Issues
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
Madjid Khalilian, Norwati Mustapha
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
FSTTCS
2009
Springer
16 years 1 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
205
Voted
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
15 years 11 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
213
Voted
COMPGEOM
2004
ACM
16 years 9 days ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...