2656 search results - page 84 / 532 » Design and analysis of algorithms reconsidered |
172
click to vote
NIPS
2008
15 years 7 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
256
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
249
click to vote
Publication
We propose an explicit rate indication scheme for congestion avoidance in ATM networks. In this scheme, the network switches monitor their load on each link, determining a load fac...
137
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
191
click to vote
ICASSP
2007
IEEE
16 years 19 days ago
2007
IEEE
In this paper, we analyze the convergence of an iterative selftraining semi-supervised support vector machine (SVM) algorithm, which is designed for classi cation in small trainin...