2799 search results - page 226 / 560 » computing 1998 |
150
click to vote
GD
1998
Springer
15 years 7 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
115
click to vote
GD
1998
Springer
15 years 7 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
105
Voted
ESSLLI
1999
Springer
15 years 7 months ago
1999
Springer
In this paper I take a dynamic view in the spirit of the update semantics by Veltman (1996) on the first–order model construction procedure presented by Manthey and Bry (1988)....
109
Voted
PAMI
1998
15 years 3 months ago
1998
—Because of image sampling, traditional measures of pixel dissimilarity can assign a large value to two corresponding pixels in a stereo pair, even in the absence of noise and ot...
109
Voted
MOC
1998
15 years 3 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...