11910 search results - page 2140 / 2382 » Online Learning Algorithms |
230
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
210
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
212
click to vote
WWW
2010
ACM
16 years 2 months ago
2010
ACM
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
204
click to vote
WSDM
2009
ACM
16 years 2 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
206
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...