15375 search results - page 2827 / 3075 » cans 2008 |
203
click to vote
SIAMSC
2011
15 years 1 months ago
2011
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on ...
175
click to vote
ECCC
2010
15 years 1 months ago
2010
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
146
click to vote
TIT
2010
15 years 1 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
206
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We describe recent progress in the field of prosodic modeling for speaker verification. In a previous paper, we proposed a technique for modeling syllable-based prosodic feature...
156
click to vote
ACL
2011
14 years 10 months ago
2011
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...