Sciweavers

11784 search results - page 128 / 2357
» Interpolation for data structures
Sort
View
COMPGEOM
2003
ACM
15 years 4 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
CSDA
2007
264views more  CSDA 2007»
14 years 11 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 4 months ago
Latent Structure Models for the Analysis of Gene Expression Data
Cluster methods have been successfully applied in gene expression data analysis to address tumor classification. By grouping tissue samples into homogeneous subsets, more systema...
Dong Hua, Dechang Chen, Xiuzhen Cheng, Abdou Youss...
CC
2005
Springer
115views System Software» more  CC 2005»
15 years 4 months ago
Hob: A Tool for Verifying Data Structure Consistency
Abstract. This tool demonstration presents Hob, a system for verifying data structure consistency for programs written in a general-purpose programming language. Our tool enables t...
Patrick Lam, Viktor Kuncak, Martin C. Rinard
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
15 years 3 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao