19866 search results - page 35 / 3974 » Computing all factorizations in *** |
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
CG
2007
Springer
14 years 11 months ago
2007
Springer
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
175
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
100
click to vote
CRYPTO
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
SAMOS
2007
Springer
15 years 6 months ago
2007
Springer
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...