1382 search results - page 40 / 277 » Formal Analysis of Online Algorithms |
151
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
149
click to vote
ICDAR
2009
IEEE
16 years 15 days ago
2009
IEEE
We propose script-specific post processing schemes for improving the recognition rate of online Tamil characters. At the first level, features derived at each sample point of the ...
181
click to vote
ICDAR
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
174
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
147
click to vote
LREC
2008
15 years 7 months ago
2008
This paper presents the design and construction of a Chinese opinion corpus. Based on the observation on the characteristics of opinion expression in Chinese online product review...