1382 search results - page 27 / 277 » Formal Analysis of Online Algorithms |
146
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
We compare the practical performance of several recently proposed algorithms for active learning in the online classification setting. We consider two active learning algorithms (...
176
click to vote
COR
2011
15 years 7 days ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
151
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
141
click to vote
ICFEM
2000
Springer
15 years 9 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
135
click to vote
ICDAR
2009
IEEE
16 years 14 days ago
2009
IEEE
In this paper, we propose a novel approach for understanding and analyzing the online handwritten chemical formulas. With the structural characteristics, semantic rules, and more ...