4112 search results - page 172 / 823 » Efficient Algorithms for the Spoonerism Problem |
253
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
127
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
137
click to vote
CCCG
2008
15 years 6 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
119
click to vote
TIP
2008
15 years 4 months ago
2008
We present a two-stage method for obtaining both phase and object estimates from phase-diversity time series data. In the first stage, the phases are estimated for each time frame...