Sciweavers

5595 search results - page 207 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SSDBM
2005
IEEE
218views Database» more  SSDBM 2005»
15 years 12 months ago
The "Best K" for Entropy-based Categorical Data Clustering
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...
Keke Chen, Ling Liu
COMPGEOM
2003
ACM
15 years 11 months ago
Shape fitting with outliers
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
Sariel Har-Peled, Yusu Wang
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 12 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
IPPS
2003
IEEE
15 years 11 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
CEE
2011
106views more  CEE 2011»
14 years 10 months ago
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks
  Performance  of  ad  hoc  networks  dramatically  declines  as  network  grows.  Cluster  formation  in  which  the  network  hosts  are  hierarchically  part...
Javad Akbari Torkestani, Mohammad Reza Meybodi