Sciweavers

1576 search results - page 166 / 316
» Streaming Algorithms for Independent Sets
Sort
View
ISCC
2000
IEEE
112views Communications» more  ISCC 2000»
15 years 8 months ago
RED Behavior with Different Packet Sizes
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 4 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
SIROCCO
1998
15 years 5 months ago
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Stefan Dobrev, Peter Ruzicka, Gerard Tel
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 2 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
JMLR
2010
115views more  JMLR 2010»
14 years 11 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto