Sciweavers

1284 search results - page 125 / 257
» Data Structures for Mergeable Trees
Sort
View
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
14 years 3 months ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer
INFOCOM
2002
IEEE
14 years 3 months ago
Host Multicast: A Framework for Delivering Multicast To End Users
Abstract—While the advantages of multicast delivery over multiple unicast deliveries is undeniable, the deployment of the IP multicast protocol has been limited to “islands” ...
Beichuan Zhang, Sugih Jamin, Lixia Zhang
BDA
2006
13 years 11 months ago
Integrating Correction into Incremental Validation
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...
Béatrice Bouchou, Ahmed Cheriat, Mirian Hal...
PODC
2004
ACM
14 years 3 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
JACM
2007
132views more  JACM 2007»
13 years 10 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup