Sciweavers

5595 search results - page 144 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
OL
2010
140views more  OL 2010»
14 years 11 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
152
Voted
FOCS
2007
IEEE
15 years 11 months ago
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
Anna Gál, Parikshit Gopalan
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 6 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
IPL
2011
91views more  IPL 2011»
14 years 12 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
CORR
2011
Springer
229views Education» more  CORR 2011»
14 years 12 months ago
"Improved FCM algorithm for Clustering on Web Usage Mining"
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
K. Suresh