Sciweavers

7006 search results - page 1177 / 1402
» Approximation Algorithms
Sort
View
159
Voted
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 6 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
SIROCCO
2010
15 years 7 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
ERSA
2004
106views Hardware» more  ERSA 2004»
15 years 7 months ago
QOS Aware HW/SW Partitioning on Run-time Reconfigurable Multimedia Platforms
Advanced multimedia applications (e.g. based on MPEG-4) will consist of multiple scalable multimedia objects. This scalability enables the application to adapt to different proces...
Nam Pham Ngoc, Gauthier Lafruit, Jean-Yves Mignole...
FLAIRS
2004
15 years 7 months ago
Backcalculation of Airport Flexible Pavement Non-Linear Moduli Using Artificial Neural Networks
The Heavy Weight Deflectometer (HWD) test is one of the most widely used tests for assessing the structural integrity of airport pavements in a non-destructive manner. The elastic...
Kasthurirangan Gopalakrishnan, Marshall R. Thompso...
« Prev « First page 1177 / 1402 Last » Next »