43 search results - page 8 / 9 » Optimal Two-Dimensional Compressed Matching |
FOCS
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
ACCV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
NIPS
2008
13 years 6 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
— Motivated by video coding applications, we study the problem of sequential coding of correlated sources with (noncausal) encoding and/or decoding frame-delays. The fundamental ...
IANDC
2008
13 years 5 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...