Sciweavers

2127 search results - page 44 / 426
» Computing large matchings fast
Sort
View
87
Voted
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
15 years 7 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
111
Voted
DAGM
2006
Springer
15 years 7 months ago
Shape Matching by Variational Computation of Geodesics on a Manifold
Abstract. Klassen et al. [9] recently developed a theoretical formulation to model shape dissimilarities by means of geodesics on appropriate spaces. They used the local geometry o...
Frank R. Schmidt, Michael Clausen, Daniel Cremers
123
Voted
NIPS
2008
15 years 4 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
124
Voted
IEEESCC
2007
IEEE
15 years 9 months ago
Swift: Fast, Reliable, Loosely Coupled Parallel Computation
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...
Yong Zhao, Mihael Hategan, Ben Clifford, Ian T. Fo...
157
Voted
DCC
1995
IEEE
15 years 7 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe