Sciweavers

3267 search results - page 538 / 654
» Generalized quasirandom graphs
Sort
View
AICT
2006
IEEE
16 years 15 days ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
BROADNETS
2006
IEEE
16 years 14 days ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
BROADNETS
2006
IEEE
16 years 14 days ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage
FOCS
2006
IEEE
16 years 14 days ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
16 years 14 days ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...