Sciweavers

13214 search results - page 260 / 2643
» Pseudorandomness for network algorithms
Sort
View
SODA
2004
ACM
67views Algorithms» more  SODA 2004»
15 years 8 months ago
Trade-offs on the location of the core node in a network
Jean-François Macq, Michel X. Goemans
SODA
1996
ACM
143views Algorithms» more  SODA 1996»
15 years 8 months ago
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
Robert Lupton, F. Miller Maley, Neal E. Young
ICANN
1997
Springer
15 years 10 months ago
A Boosting Algorithm for Regression
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...
Alberto Bertoni, Paola Campadelli, M. Parodi
160
Voted
BROADNETS
2006
IEEE
15 years 10 months ago
Jitter-based analysis and discussion of burst assembly algorithms
This work provides a jitter analysis of size-based burst assembly algorithms and also discusses other burst assembly algorithms that use the packet delay as the assembly threshold ...
Javier Aracil, José Alberto Hernánde...
193
Voted
INFOCOM
2005
IEEE
16 years 8 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...