3415 search results - page 286 / 683 » Lower bounds on kernelization |
169
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
173
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
178
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
181
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper studies the design and analysis of optimal training-based beamforming in uncorrelated multipleinput multiple-output (MIMO) channels with known Gaussian statistics. Fi...
189
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...