Sciweavers

147 search results - page 9 / 30
» Very sparse random projections
Sort
View
NIPS
2008
13 years 9 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
PROPERTYTESTING
2010
13 years 5 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
Swastik Kopparty, Shubhangi Saraf
NIPS
2007
13 years 9 months ago
Compressed Regression
Recent research has studied the role of sparsity in high dimensional regression and signal reconstruction, establishing theoretical limits for recovering sparse models from sparse...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
IDEAL
2010
Springer
13 years 6 months ago
Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
Carsten Elfers, Mirko Horstmann, Karsten Sohr, Ott...
SSIAI
2002
IEEE
14 years 20 days ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge