Sciweavers

4536 search results - page 67 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PLDI
2005
ACM
14 years 2 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
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
14 years 2 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...
ICASSP
2011
IEEE
13 years 14 days ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus
PVLDB
2010
120views more  PVLDB 2010»
13 years 7 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 10 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...