12519 search results - page 272 / 2504 » Approximation Problems Categories |
173
click to vote
CGF
2002
15 years 6 months ago
2002
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...
195
click to vote
WAOA
2005
Springer
16 years 2 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
178
Voted
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
157
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
The subcellular location of proteins is most often determined by visual interpretation of fluorescence microscope images. In recent years, automated systems have been developed so...
290
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...