Sciweavers

768 search results - page 48 / 154
» Asymptotic Cellular Complexity
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
ANSS
2003
IEEE
14 years 29 days ago
Implementing Parallel Cell-DEVS
Cell-DEVS is a formalism intended to model complex physical systems as cell spaces. Cell-DEVS allow describing cellular models using timing delay constructions, allowing simple de...
Alejandro Troccoli, Gabriel A. Wainer
ICPP
1995
IEEE
13 years 11 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
EUROCRYPT
2011
Springer
12 years 11 months ago
Implementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
Craig Gentry, Shai Halevi
MOC
2011
13 years 2 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont