4463 search results - page 187 / 893 » computer 2000 |
106
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
122
Voted
INFORMATICALT
2000
15 years 3 months ago
2000
Abstract. Influence of projection pursuit on classification errors and estimates of a posteriori probabilities from the sample is considered. Observed random variable is supposed t...
122
click to vote
INFORMATICALT
2000
15 years 3 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
133
Voted
JC
2000
15 years 3 months ago
2000
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
110
Voted
ICMCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we describe a real-time face-tracking algorithm. We start with single face tracking based on statistical color modeling and the deformable template. We then expand ...