Sciweavers

1578 search results - page 160 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
NOMS
2010
IEEE
177views Communications» more  NOMS 2010»
13 years 8 months ago
An effective similarity metric for application traffic classification
—Application level traffic classification is one of the major issues in network monitoring and traffic engineering. In our previous study, we proposed a new traffic classificatio...
Jae Yoon Chung, Byungchul Park, Young J. Won, John...
GCC
2003
Springer
14 years 3 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
JSAC
2006
81views more  JSAC 2006»
13 years 10 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup