Sciweavers

796 search results - page 28 / 160
» Approximating the centroid is hard
Sort
View
PLDI
2006
ACM
14 years 1 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
ICML
2009
IEEE
14 years 2 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye
OTM
2005
Springer
14 years 1 months ago
Automatic Acquisition of Fuzzy Footprints
Gazetteer services are an important component in a wide variety of systems, including geographic search engines and question answering systems. Unfortunately, the footprints provid...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
ECCC
2010
124views more  ECCC 2010»
13 years 7 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
FOCS
2007
IEEE
14 years 1 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket