Sciweavers

3415 search results - page 390 / 683
» Lower bounds on kernelization
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
IJCAI
2007
15 years 8 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
15 years 8 months ago
On Point Sampling Versus Space Sampling for Dimensionality Reduction
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
Charu C. Aggarwal
FIW
2003
115views Communications» more  FIW 2003»
15 years 8 months ago
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
Muffy Calder, Alice Miller
DCG
2008
76views more  DCG 2008»
15 years 6 months ago
Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
E. D. Gluskin, A. E. Litvak