Sciweavers

478 search results - page 26 / 96
» Diameter and Center Computations in Networks
Sort
View
DMSN
2004
ACM
15 years 5 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
ANNPR
2006
Springer
15 years 3 months ago
Incremental Training of Support Vector Machines Using Truncated Hypercones
We discuss incremental training of support vector machines in which we approximate the regions, where support vector candidates exist, by truncated hypercones. We generate the trun...
Shinya Katagiri, Shigeo Abe
BROADNETS
2006
IEEE
15 years 3 months ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani
GLOBECOM
2010
IEEE
14 years 9 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...
HOTNETS
2010
14 years 6 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio