Sciweavers

219 search results - page 1 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 7 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
BMCBI
2010
139views more  BMCBI 2010»
13 years 4 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
ACL
2001
13 years 5 months ago
Fast Decoding and Optimal Decoding for Machine Translation
A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according...
Ulrich Germann, Michael Jahr, Kevin Knight, Daniel...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
13 years 10 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
COMPGEOM
2001
ACM
13 years 8 months ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled