1942 search results - page 71 / 389 » Speeding Up XTR |
128
click to vote
ANTS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
101
click to vote
ASPDAC
2000
ACM
15 years 5 months ago
2000
ACM
We propose an efficient hardware architecture for the Blowfish algorithm [1]. The speed is up to 4 bit/clock, which is 9 times faster than a Pentium. By applying operator-reschedul...
101
click to vote
BNCOD
2001
15 years 3 months ago
2001
Abstract. Integrating, cleaning and analyzing data from heterogeneous sources is often complicated by the large amounts of data and its physical distribution which can result in po...
IJCAI
2001
15 years 3 months ago
2001
We present an empirical analysis of optimization techniques devised to speed up the so-called TBox classification supported by description logic systems which have to deal with ve...
126
click to vote
AAECC
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...