5169 search results - page 217 / 1034 » Locality approximation using time |
124
click to vote
CISS
2008
IEEE
16 years 25 days ago
2008
IEEE
Abstract— Costas array enumeration is an NP-complete problem with a highly parallelize-able solution. This paper examines the implementation of a solution to this problem on an F...
127
click to vote
ICASSP
2008
IEEE
16 years 24 days ago
2008
IEEE
We consider probabilistic methods to compute the near midair collision risk using state estimate and covariance from a target tracking filter based on angle-only sensors such as ...
162
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
193
Voted
PKC
2010
Springer
15 years 4 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
307
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...