81 search results - page 12 / 17 » Empirical Lower Bounds on the Complexity of Translational Eq... |
ICT
2004
Springer
14 years 22 days ago
2004
Springer
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
SWAT
2004
Springer
14 years 21 days ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
UAI
2000
13 years 8 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
COCO
2005
Springer
14 years 27 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...