Sciweavers

1522 search results - page 64 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
PDP
2003
IEEE
14 years 1 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Random Selection with an Adversarial Majority
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
ICML
2010
IEEE
13 years 8 months ago
On the Interaction between Norm and Dimensionality: Multiple Regimes in Learning
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
Percy Liang, Nati Srebro
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 7 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
PRL
2011
13 years 2 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino