916 search results - page 172 / 184 » Using redundancies to find errors |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
93
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
170
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
KDD
2009
ACM
15 years 10 months 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...
189
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...