Sciweavers

11211 search results - page 90 / 2243
» Rank-Sensitive Data Structures
Sort
View
93
Voted
OSDI
2008
ACM
16 years 1 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
110
Voted
ICML
2003
IEEE
16 years 1 months ago
Identifying Predictive Structures in Relational Data Using Multiple Instance Learning
This paper introduces an approach for identifying predictive structures in relational data using the multiple-instance framework. By a predictive structure, we mean a structure th...
Amy McGovern, David Jensen
96
Voted
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 2 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
110
Voted
DMDW
2003
120views Management» more  DMDW 2003»
15 years 2 months ago
Well-formed data warehouse structures
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...
Michel Schneider
107
Voted
PLDI
2010
ACM
15 years 5 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta