Sciweavers

5640 search results - page 898 / 1128
» Parallelizing the Data Cube
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
VISSYM
2003
14 years 11 hour ago
Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
Jing Yang, Matthew O. Ward, Elke A. Rundensteiner,...
BMCBI
2010
151views more  BMCBI 2010»
13 years 10 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
TASLP
2008
140views more  TASLP 2008»
13 years 10 months ago
Acoustic Chord Transcription and Key Extraction From Audio Using Key-Dependent HMMs Trained on Synthesized Audio
We describe an acoustic chord transcription system that uses symbolic data to train hidden Markov models and gives best-of-class frame-level recognition results. We avoid the extre...
Kyogu Lee, Malcolm Slaney
BMCBI
2005
196views more  BMCBI 2005»
13 years 10 months ago
Chemistry in Bioinformatics
Chemical information is now seen as critical for most areas of life sciences. But unlike Bioinformatics, where data is Openly available and freely re-usable, most chemical informa...
Peter Murray-Rust, John B. O. Mitchell, Henry S. R...