9849 search results - page 121 / 1970 » Algorithms and Experiments for the Webgraph |
133
click to vote
MICCAI
2007
Springer
16 years 5 months ago
2007
Springer
Abstract. We propose a non-parametric diffeomorphic image registration algorithm based on Thirion's demons algorithm. The demons algorithm can be seen as an optimization proce...
109
click to vote
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
109
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
119
click to vote
ACIVS
2006
Springer
15 years 10 months ago
2006
Springer
In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the best known and most used method. Although FCM is a very useful method, it is sensitive to noise and outliers so that W...
147
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...