1382 search results - page 1 / 277 » Formal Analysis of Online Algorithms |
120
Voted
ATVA
2011
Springer
14 years 1 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
135
Voted
DAWAK
2010
Springer
15 years 2 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
107
click to vote
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
80
Voted
SAS
2010
Springer
14 years 11 months ago
2010
Springer
101
Voted
SIGIR
2002
ACM
15 years 21 days ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...