Sciweavers

1403 search results - page 91 / 281
» Set cover algorithms for very large datasets
Sort
View
ICCS
2001
Springer
15 years 8 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
VCIP
2003
147views Communications» more  VCIP 2003»
15 years 5 months ago
An objective method for combining multiple subjective data sets
International recommendations for subjective video quality assessment (e.g., ITU-R BT.500-11) include specifications for how to perform many different types of subjective tests. I...
Margaret H. Pinson, Stephen Wolf
BMCBI
2008
125views more  BMCBI 2008»
15 years 4 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
JSS
2007
67views more  JSS 2007»
15 years 4 months ago
TFRP: An efficient microaggregation algorithm for statistical disclosure control
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
Chin-Chen Chang, Yu-Chiang Li, Wen-Hung Huang
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
16 years 4 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu