Sciweavers

3466 search results - page 40 / 694
» Fast computation of special resultants
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 11 months ago
Fast direction-aware proximity for graph mining
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...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
BILDMED
2007
109views Algorithms» more  BILDMED 2007»
14 years 13 days ago
A Fast and Flexible Image Registration Toolbox
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...
Nils Papenberg, Hanno Schumacher, Stefan Heldmann,...
CEC
2005
IEEE
14 years 4 months ago
Fast evolution of custom machine representations
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
Lorenz Huelsbergen
ISMVL
2000
IEEE
105views Hardware» more  ISMVL 2000»
14 years 3 months ago
Computational Neurobiology Meets Semiconductor Engineering
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...
Dan W. Hammerstrom
PARA
1994
Springer
14 years 3 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
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...
José M. Badía, Antonio M. Vidal