Sciweavers

11231 search results - page 68 / 2247
» Digging for Data Structures
Sort
View
ICDM
2008
IEEE
182views Data Mining» more  ICDM 2008»
15 years 5 months ago
Multiple-Instance Regression with Structured Data
We present a multiple-instance regression algorithm that models internal bag structure to identify the items most relevant to the bag labels. Multiple-instance regression (MIR) op...
Kiri L. Wagstaff, Terran Lane, Alex Roper
COCOON
2005
Springer
15 years 4 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
PLDI
2005
ACM
15 years 4 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
FGCS
2007
107views more  FGCS 2007»
14 years 11 months ago
Algorithmic re-structuring and data replication for protein structure comparison on a GRID
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an...
Giovanni Ciriello, M. Comin, Concettina Guerra
ICIP
1999
IEEE
16 years 23 days ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...