Sciweavers

1503 search results - page 68 / 301
» Self-optimizing distributed trees
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
14 years 1 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ISPDC
2008
IEEE
14 years 4 months ago
Load Balancing in Mesh-like Computations using Prediction Binary Trees
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....
Biagio Cosenza, Gennaro Cordasco, Rosario De Chiar...
ICNP
2005
IEEE
14 years 3 months ago
Intersection Characteristics of End-to-End Internet Paths and Trees
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
Sevcan Bilir, Kamil Saraç, Turgay Korkmaz
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
14 years 3 months ago
Reducing the Forwarding State Requirements of Point-to-Multipoint Trees Using MPLS Multicast
IP multicast was first proposed to improve the performance of applications that require group communications. Still, many years after its initial proposal, IP multicast is not wi...
George Apostolopoulos, Ioana Ciurea
INFOSCALE
2007
ACM
13 years 11 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou