Sciweavers

1521 search results - page 20 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
BMCBI
2007
200views more  BMCBI 2007»
15 years 1 months ago
Assessment of algorithms for high throughput detection of genomic copy number variation in oligonucleotide microarray data
Background: Genomic deletions and duplications are important in the pathogenesis of diseases, such as cancer and mental retardation, and have recently been shown to occur frequent...
Ágnes Baross, Allen D. Delaney, H. Irene Li...
95
Voted
PARA
2004
Springer
15 years 7 months ago
A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...
Frank Günther, Miriam Mehl, Markus Pögl,...
155
Voted
STACS
2010
Springer
15 years 8 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
108
Voted
VLDB
1998
ACM
153views Database» more  VLDB 1998»
15 years 6 months ago
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate ...
Guido Moerkotte
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
16 years 3 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal