11211 search results - page 103 / 2243 » Rank-Sensitive Data Structures |
152
Voted
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
129
Voted
PLDI
2012
ACM
13 years 3 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
83
Voted
TLDI
2005
ACM
15 years 6 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
113
Voted
GFKL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
114
Voted
BMCBI
2008
15 years 25 days ago
2008
Background: The unsupervised discovery of structures (i.e. clusterings) underlying data is a central issue in several branches of bioinformatics. Methods based on the concept of s...