Sciweavers

38 search results - page 6 / 8
» On the Impossibility of Strong Encryption Over
Sort
View
ACL
2006
13 years 7 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu
MP
2006
119views more  MP 2006»
13 years 5 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
TSP
2008
102views more  TSP 2008»
13 years 5 months ago
Bias Corrected PSD Estimation for an Adaptive Array With Moving Interference
We address the issue of computing power spectral density (PSD) estimates at the output of a beamforming sensor array in the presence of strong moving interference. It is shown that...
Brian D. Jeffs, Karl F. Warnick
PRL
2011
12 years 8 months ago
A Bayes-true data generator for evaluation of supervised and unsupervised learning methods
Benchmarking pattern recognition, machine learning and data mining methods commonly relies on real-world data sets. However, there are some disadvantages in using real-world data....
Janick V. Frasch, Aleksander Lodwich, Faisal Shafa...
EUROCRYPT
2001
Springer
13 years 10 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul