1369 search results - page 42 / 274 » Lattice computations for random numbers |
ISSTA
2006
ACM
14 years 2 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
GI
2009
Springer
13 years 6 months ago
2009
Springer
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
SIAMSC
2010
13 years 7 months ago
2010
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
HOTI
2005
IEEE
14 years 2 months ago
2005
IEEE
High performance routers require substantial amounts of memory to store packets awaiting transmission, requiring the use of dedicated memory devices with the density and capacity ...