3466 search results - page 40 / 694 » Fast computation of special resultants |
KDD
2007
ACM
16 years 1 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
89
Voted
BILDMED
2007
15 years 2 months ago
2007
Abstract. In the last decades there has been tremendous research towards the design of fully automatic non-rigid registration schemes. However, apart from the ITK based implementat...
100
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
91
Voted
ISMVL
2000
IEEE
15 years 5 months ago
2000
IEEE
Many believe that the most important result to come out of the last ten years of neural network research is the significant change in perspective in the neuroscience community tow...
83
Voted
PARA
1994
Springer
15 years 4 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...