11784 search results - page 119 / 2357 » Interpolation for data structures |
PKDD
1999
Springer
15 years 3 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...
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...
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...
68
Voted
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...