569 search results - page 72 / 114 » Online Bounds for Bayesian Algorithms |
WEA
2005
Springer
15 years 3 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
TCS
2008
14 years 9 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
CPM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
FUZZIEEE
2007
IEEE
15 years 4 months ago
2007
IEEE
The algorithm of on-line predictor from input-output data pairs will be proposed. In this paper, it proposed an approach to generate fuzzy rules of predictor from real-time input-o...