Sciweavers

339 search results - page 28 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
MST
2002
128views more  MST 2002»
14 years 9 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
CVPR
2007
IEEE
15 years 11 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
77
Voted
PODC
2003
ACM
15 years 2 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
80
Voted
IPPS
2008
IEEE
15 years 4 months ago
Financial modeling on the cell broadband engine
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
Virat Agarwal, Lurng-Kuo Liu, David A. Bader
92
Voted
ICALP
2009
Springer
15 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner