Sciweavers

1913 search results - page 27 / 383
» Group Input Machine
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
ISBI
2008
IEEE
15 years 10 months ago
Improved fMRI group studies based on spatially varying non-parametric BOLD signal modeling
Multi-subject analysis of functional Magnetic Resonance Imaging (fMRI) data relies on within-subject studies, which are usually conducted using a massively univariate approach. In...
Philippe Ciuciu, Thomas Vincent, Anne-Laure Fouque...
89
Voted
CRYPTO
2003
Springer
98views Cryptology» more  CRYPTO 2003»
15 years 2 months ago
A Message Authentication Code Based on Unimodular Matrix Groups
We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of w...
Matthew Cary, Ramarathnam Venkatesan
58
Voted
MFCS
2000
Springer
15 years 1 months ago
On the Autoreducibility of Random Sequences
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
Todd Ebert, Heribert Vollmer
CLEF
2011
Springer
13 years 9 months ago
Detecting Wikipedia Vandalism using Machine Learning - Notebook for PAN at CLEF 2011
Wikipedia vandalism identification is a very complex issue, which is now mostly solved manually by volunteers. This paper presents the main components of a system built by our grou...
Cristian-Alexandru Dragusanu, Marina Cufliuc, Adri...