72 search results - page 5 / 15 » What can be efficiently reduced to the Kolmogorov-random str... |
IEEEMSP
2002
IEEE
14 years 1 months ago
2002
IEEE
Music query-by-humming is a challenging problem since the humming query inevitably contains much variation and inaccuracy. Many of the previous methods, which adopt note segmentat...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ESWS
2009
Springer
13 years 6 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
ALGORITHMICA
2010
13 years 8 months ago
2010
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...