29 search results - page 6 / 6 » An Improved Lower Bound for the Complementation of Rabin Aut... |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
AAAI
2010
13 years 6 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
TSP
2008
13 years 4 months ago
2008
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...