3875 search results - page 483 / 775 » Approximation algorithms for the 0-extension problem |
187
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
203
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
167
click to vote
IPCO
2007
15 years 8 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
160
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
174
click to vote
TIT
2008
15 years 6 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...