Sciweavers

8294 search results - page 391 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 6 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
POPL
2010
ACM
16 years 4 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 7 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
HIPC
2009
Springer
15 years 4 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
BMCBI
2008
259views more  BMCBI 2008»
15 years 6 months ago
DISCLOSE : DISsection of CLusters Obtained by SEries of transcriptome data using functional annotations and putative transcripti
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
Evert-Jan Blom, Sacha A. F. T. van Hijum, Klaas J....