Sciweavers

1168 search results - page 191 / 234
» cases 2000
Sort
View
GPEM
2000
121views more  GPEM 2000»
14 years 9 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
IANDC
2000
64views more  IANDC 2000»
14 years 9 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
IJCV
2000
230views more  IJCV 2000»
14 years 9 months ago
Design and Use of Linear Models for Image Motion Analysis
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
David J. Fleet, Michael J. Black, Yaser Yacoob, Al...
ISCI
2000
92views more  ISCI 2000»
14 years 9 months ago
Quantum associative memory
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. Quantum computation uses microscopic quantum lev...
Dan Ventura, Tony R. Martinez
JACM
2000
119views more  JACM 2000»
14 years 9 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