Sciweavers

10392 search results - page 403 / 2079
» Introduction to Computer Science
Sort
View
DCC
2011
IEEE
15 years 1 months ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...
HICSS
2009
IEEE
114views Biometrics» more  HICSS 2009»
16 years 1 months ago
GrayWulf: Scalable Clustered Architecture for Data Intensive Computing
Alexander S. Szalay, Gordon Bell, Jan vandenBerg, ...
FCCM
2009
IEEE
204views VLSI» more  FCCM 2009»
15 years 10 months ago
Acceleration and Energy Efficiency of a Geometric Algebra Computation using Reconfigurable Computers and GPUs
Geometric algebra (GA) is a mathematical framework that allows the compact description of geometric relationships and algorithms in many fields of science and engineering. The exe...
Holger Lange, Florian Stock, Andreas Koch, Dietmar...
TAMC
2007
Springer
16 years 29 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
TCS
2011
15 years 1 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner