1093 search results - page 69 / 219 » Fast Abstracts |
144
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
108
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
136
Voted
CC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
ECIS
2003
15 years 3 months ago
2003
Today, companies and their information systems are facing a very dynamic and fast changing environment. Fast changing demands require varying information in varying places. Users ...
94
Voted
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...