Sciweavers

6045 search results - page 874 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
FAC
2000
94views more  FAC 2000»
15 years 6 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A subdivision-based algorithm for the sparse resultant
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...
John F. Canny, Ioannis Z. Emiris
149
Voted
PR
2000
106views more  PR 2000»
15 years 6 months ago
Non-linear image processing in hardware
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...
Antonios Gasteratos, Ioannis Andreadis
IJCV
2002
157views more  IJCV 2002»
15 years 6 months ago
Dense Features for Semi-Dense Stereo Correspondence
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...
Olga Veksler
DAM
1998
77views more  DAM 1998»
15 years 6 months ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin