Sciweavers

1389 search results - page 172 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
DASFAA
2008
IEEE
120views Database» more  DASFAA 2008»
16 years 23 days ago
Knowledge Transferring Via Implicit Link Analysis
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different ...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Yong Yu
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 6 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
FOCS
2008
IEEE
16 years 23 days ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
15 years 11 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
ICML
2005
IEEE
16 years 7 months ago
Supervised dimensionality reduction using mixture models
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
Sajama, Alon Orlitsky