Sciweavers

1888 search results - page 93 / 378
» Proof theory and computational analysis
Sort
View
98
Voted
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
14 years 11 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
81
Voted
ICML
2005
IEEE
16 years 1 months ago
A brain computer interface with online feedback based on magnetoencephalography
The aim of this paper is to show that machine learning techniques can be used to derive a classifying function for human brain signal data measured by magnetoencephalography (MEG)...
Bernhard Schölkopf, Hubert Preißl, J&uu...
ENTCS
2007
126views more  ENTCS 2007»
15 years 9 days ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...
TCS
2008
15 years 12 days ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 10 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...