Sciweavers

198 search results - page 7 / 40
» A Sequential Algorithm for Generating Random Graphs
Sort
View
ICS
1998
Tsinghua U.
15 years 1 months ago
Techniques for Empirical Testing of Parallel Random Number Generators
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
Paul D. Coddington, Sung Hoon Ko
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
15 years 3 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein
ICPR
2004
IEEE
15 years 10 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach
ICPP
2006
IEEE
15 years 3 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
ACCV
2009
Springer
15 years 4 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee