1503 search results - page 159 / 301 » Self-optimizing distributed trees |
121
Voted
FTDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
137
click to vote
COLT
2001
Springer
15 years 7 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
108
Voted
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents a methodology to derive asynchronous circuits from optimized synchronous circuits by replacing the clock distribution tree by a handshaking network. A case stu...
156
Voted
BROADNETS
2006
IEEE
15 years 4 months ago
2006
IEEE
Multicast protocols for MANET typically construct a tree or mesh structure for multicast message distribution. Typical implementations impose scalability and efficiency limitation...
108
click to vote
FUIN
2007
15 years 2 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...