6365 search results - page 123 / 1273 » Fast Local Computation Algorithms |
172
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
168
click to vote
NPAR
2000
ACM
15 years 8 months ago
2000
ACM
This paper presents a new method for the automatic painterly rendering. This method synthesizes an impressive image with a handcrafted look from a source image such as a photograp...
124
click to vote
ARITH
1993
IEEE
15 years 9 months ago
1993
IEEE
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
136
click to vote
ICCS
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
137
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
When comparing different methods for face detection or localization, one realizes that just simply comparing the reported results is misleading as, even if the results are reporte...