Sciweavers

6365 search results - page 224 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPPW
2005
IEEE
16 years 9 hour ago
A Niche for Parallel Island Models: Outliers and Local Search
This paper reports on the development of a novel island model for evolutionary algorithms, which is intrinsically parallel and intended to better utilise resources and outlier sol...
Steven Gustafson, Edmund K. Burke
CVPR
2007
IEEE
15 years 10 months ago
Local Shape Registration Using Boundary-Constrained Match of Skeletons
This paper presents a new shape registration algorithm that establishes "meaningful correspondence" between objects, in that it preserves the local shape correspondence ...
Yun Zhu, Xenophon Papademetris, Albert J. Sinusas,...
CVPR
2007
IEEE
16 years 8 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
CVPR
2010
IEEE
16 years 2 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
CRYPTO
1995
Springer
111views Cryptology» more  CRYPTO 1995»
15 years 10 months ago
Fast Key Exchange with Elliptic Curve Systems
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
Richard Schroeppel, Hilarie K. Orman, Sean W. O'Ma...