11231 search results - page 62 / 2247 » Digging for Data Structures |
112
click to vote
PLDI
2012
ACM
13 years 1 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...
TLDI
2005
ACM
15 years 4 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....
GFKL
2004
Springer
15 years 4 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...
97
Voted
BMCBI
2008
14 years 11 months 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...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...