459 search results - page 28 / 92 » Average Case Analysis of Conjunctive Learning Algorithms |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Correlation is one of the most widely used similarity measures in machine learning like Euclidean and Mahalanobis distances. However, compared with proposed numerous discriminant ...
ICDAR
2003
IEEE
14 years 29 days ago
2003
IEEE
The purpose of this paper is to present a novel contour code feature in conjunction with a rule based segmentation for cursive handwriting recognition. A heuristic segmentation al...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...