1284 search results - page 51 / 257 » Data Structures for Mergeable Trees |
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 ...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
EUROPAR
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
APWEB
2004
Springer
14 years 27 days ago
2004
Springer
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...