Sciweavers

9849 search results - page 236 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
CCR
2008
94views more  CCR 2008»
15 years 6 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
COMCOM
2008
100views more  COMCOM 2008»
15 years 6 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
206
Voted
AROBOTS
2006
95views more  AROBOTS 2006»
15 years 6 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese
CN
2007
137views more  CN 2007»
15 years 6 months ago
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm
The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks...
Laura Galluccio, Giacomo Morabito, Sergio Palazzo,...
COMCOM
2007
89views more  COMCOM 2007»
15 years 6 months ago
On-the-fly TCP path selection algorithm in access link load balancing
—Many enterprises install multiple access links for fault tolerance or bandwidth enlargement. Dispatching connections through good links is the ultimate goal in utilizing multipl...
Ying-Dar Lin, Shih-Chiang Tsao, Un-Pio Leong