Sciweavers

4463 search results - page 186 / 893
» computer 2000
Sort
View
COMPGEOM
2000
ACM
15 years 8 months ago
Pitfalls in computing with pseudorandom determinants
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
Bernd Gärtner
127
Voted
ICALP
2000
Springer
15 years 7 months ago
Computing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Hristo Djidjev
132
Voted
SSPR
2000
Springer
15 years 7 months ago
Assessing the Computational Effort for Structural 3D Vehicle Recognition
A model based structural recognition approach is used for 3D detection and localization of vehicles. It is theoretically founded by syntactic pattern recognition using coordinate g...
Eckart Michaelsen, Uwe Stilla
WIA
2000
Springer
15 years 7 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
121
Voted
PDPTA
2000
15 years 4 months ago
On Using the UML to Describe the MASC Model of Parallel Computation
- A Unified Modeling Language (UML) description of the MASC model of parallel computation is presented. This UML description identifies MASC objects and specifies various object an...
Michael Scherger, Johnnie Potter, Jerry W. Baker