Sciweavers

497 search results - page 75 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 3 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
CISS
2007
IEEE
15 years 1 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
SIGARCH
2008
94views more  SIGARCH 2008»
14 years 9 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 7 months ago
Learning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
Pooyan Khajehpour Tadavani, Ali Ghodsi
NIPS
2003
14 years 11 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini