11219 search results - page 66 / 2244 » Retroactive data structures |
PKDD
1999
Springer
15 years 4 months ago
1999
Springer
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
121
click to vote
PLDI
2012
ACM
13 years 2 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 5 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....
103
click to vote
GFKL
2004
Springer
15 years 5 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...
105
click to vote
BMCBI
2008
15 years 1 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...