1381 search results - page 32 / 277 » Structural signatures for tree data structures |
PPDP
2001
Springer
14 years 3 days ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
IPL
2010
13 years 6 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...