Sciweavers

3208 search results - page 403 / 642
» A Lower Bound for Primality
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 6 months ago
Asymptotically Good LDPC Convolutional Codes Based on Protographs
LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. In this p...
David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Z...
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
180
Voted
DM
2010
114views more  DM 2010»
15 years 6 months ago
Remarks on a generalization of the Davenport constant
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
Michael Freeze, Wolfgang A. Schmid
EOR
2010
98views more  EOR 2010»
15 years 6 months ago
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
Maria Albareda-Sambola, Juan A. Díaz, Elena...