Sciweavers

6365 search results - page 189 / 1273
» Fast Local Computation Algorithms
Sort
View
ECCV
2010
Springer
15 years 6 months ago
Efficient Computation of Scale-Space Features for Deformable Shape Correspondences
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...
Tingbo Hou, Hong Qin
SASO
2007
IEEE
16 years 13 days ago
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distrib...
Steven Y. Ko, Indranil Gupta, Yookyung Jo
IPPS
2003
IEEE
15 years 11 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
16 years 21 days ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 11 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars