777 search results - page 119 / 156 » A fast algorithm for the computation of an upper bound on th... |
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
TCOM
2008
13 years 8 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
ARC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...