Sciweavers

28 search results - page 4 / 6
» Entire Relaxation Path for Maximum Entropy Problems
Sort
View
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 2 months ago
A Comparative Study of Methods for Transductive Transfer Learning
The problem of transfer learning, where information gained in one learning task is used to improve performance in another related task, is an important new area of research. While...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
GLOBECOM
2008
IEEE
14 years 2 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
ICALP
2003
Springer
14 years 1 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
DAC
2004
ACM
14 years 8 months ago
Worst-case circuit delay taking into account power supply variations
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
Dionysios Kouroussis, Rubil Ahmadi, Farid N. Najm