Sciweavers

618 search results - page 11 / 124
» Reducibility and TT-Lifting for Computation Types
Sort
View
GRID
2007
Springer
13 years 8 months ago
Introduce: An Open Source Toolkit for Rapid Development of Strongly Typed Grid Services
Abstract Service-oriented architectures and applications have gained wide acceptance in the Grid computing community. A number of tools and middleware systems have been developed t...
Shannon Hastings, Scott Oster, Stephen Langella, D...
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
14 years 1 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
WWIC
2004
Springer
133views Communications» more  WWIC 2004»
14 years 1 months ago
Design of Energy Efficient Wireless Networks Using Dynamic Data Type Refinement Methodology
Abstract. This paper presents a new perspective to the design of wireless networks using the proposed dynamic data type refinement methodology. In the forthcoming years, new portab...
Stylianos Mamagkakis, Alexandros Mpartzas, Georgio...
LICS
2003
IEEE
14 years 1 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard
NIPS
2008
13 years 10 months ago
Effects of Stimulus Type and of Error-Correcting Code Design on BCI Speller Performance
From an information-theoretic perspective, a noisy transmission system such as a visual Brain-Computer Interface (BCI) speller could benefit from the use of errorcorrecting codes....
N. Jeremy Hill, Jason Farquhar, Suzanna Martens, F...