114 search results - page 11 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
100
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
118
click to vote
KDD
2009
ACM
16 years 28 days ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
TIT
2008
15 years 8 days ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
113
click to vote
ECCC
2008
15 years 13 days ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
125
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...