Sciweavers

15073 search results - page 382 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
AFRICACRYPT
2008
Springer
15 years 8 months ago
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
Fabien Coelho
MVA
2000
139views Computer Vision» more  MVA 2000»
15 years 7 months ago
Object Search Using Orientation Code Matching
A new method for object search is proposed. The proposed scheme is based on matching gradient information around each pixel, computed in the form of orientation codes, rather than...
Farhan Ullah, Shun'ichi Kaneko, Satoru Igarashi
182
Voted
ICPP
2008
IEEE
16 years 17 days ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
CLUSTER
2006
IEEE
16 years 6 days ago
A Parallel Algorithm for the Solution of the Deconvolution Problem on Heterogeneous Networks
In this work we present a parallel algorithm for the solution of a least squares problem with structured matrices. This problem arises in many applications mainly related to digit...
Pedro Alonso, Antonio M. Vidal, Alexey L. Lastovet...
SIGGRAPH
1993
ACM
15 years 10 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max