4212 search results - page 723 / 843 » On Compressible Pairings and Their Computation |
181
click to vote
ALMOB
2006
15 years 6 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
185
click to vote
EOR
2008
15 years 6 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
155
click to vote
CVGIP
2006
15 years 6 months ago
2006
The paper tackles the problem of feature points matching between pair of images of the same scene. This is a key problem in computer vision. The method we discuss here is a versio...
154
click to vote
CAL
2007
15 years 6 months ago
2007
Abstract—Some processors designed for consumer applications, such as Graphics Processing Units (GPUs) and the CELL processor, promise outstanding floating-point performance for ...
268
click to vote
IR
2008
15 years 6 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...