Sciweavers

17760 search results - page 3412 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
IJCV
2000
109views more  IJCV 2000»
13 years 8 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
EC
2002
121views ECommerce» more  EC 2002»
13 years 8 months ago
Group Properties of Crossover and Mutation
It is supposed that the finite search space has certain symmetries which can be described in terms of a group of permutations acting upon it. If crossover and mutation respect th...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
ENTCS
2002
78views more  ENTCS 2002»
13 years 8 months ago
Slicing Synchronous Reactive Programs
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
Vinod Ganapathy, S. Ramesh
ET
2002
97views more  ET 2002»
13 years 8 months ago
Test Generation for Crosstalk-Induced Faults: Framework and Computational Results
Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This...
Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
13 years 7 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste
« Prev « First page 3412 / 3552 Last » Next »