Sciweavers

3415 search results - page 466 / 683
» Lower bounds on kernelization
Sort
View
CAAN
2007
Springer
15 years 10 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh
ICC
2007
IEEE
114views Communications» more  ICC 2007»
15 years 10 months ago
Channel-Matched Spreading Codes for the Downlink of MC-CDMA
Abstract-- This paper concerns the multiple access performance of spreading codes used in the downlink of multicarrier code-division multiple-access (MC-CDMA). Complex-valued sprea...
Qinghua Shi, Yong Liang Guan, Choi Look Law
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 10 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
CPAIOR
2006
Springer
15 years 10 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu