Sciweavers

1038 search results - page 156 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 1 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
13 years 11 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
VISUALIZATION
2000
IEEE
14 years 6 hour ago
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Multiresolution methods are becoming increasingly important tools for the interactive visualization of very large data sets. Multiresolution isosurface visualization allows the us...
Thomas Gerstner, Renato Pajarola
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
RECOMB
2004
Springer
14 years 8 months ago
Computational identification of evolutionarily conserved exons
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
Adam C. Siepel, David Haussler