584 search results - page 13 / 117 » On the Number of Halving Planes |
105
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper we present a fast method for computing acoustic likelihoods that makes use of a Graphics Processing Unit (GPU). After enabling the GPU acceleration the main processo...
107
Voted
DATE
2002
IEEE
15 years 6 months ago
2002
IEEE
Multimedia applications are characterized by a large number of data accesses and complex array index manipulations. The built-in address decoder in the RAM memory model commonly u...
FIWAC
1993
15 years 5 months ago
1993
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
117
click to vote
COMGEO
2011
ACM
14 years 8 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
125
click to vote
COMPGEOM
2010
ACM
15 years 6 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...