5100 search results - page 902 / 1020 » The Linear Complexity of a Graph |
149
Voted
CG
2002
Springer
15 years 4 months ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
130
click to vote
JACM
2000
15 years 4 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
154
click to vote
ORL
2000
15 years 4 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
114
click to vote
PR
2000
15 years 4 months ago
2000
A new ASIC capable of computing rank order "lters, weighted rank order "lters, standard erosion and dilation, soft erosion and dilation, order statistic soft erosion and...
159
click to vote
IJCV
2002
15 years 4 months ago
2002
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...