1382 search results - page 42 / 277 » Formal Analysis of Online Algorithms |
161
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
151
click to vote
TACAS
2009
Springer
16 years 16 days ago
2009
Springer
Analysis of execution traces plays a fundamental role in many program analysis approaches. Execution traces are frequently parametric, i.e., they contain events with parameter bind...
166
click to vote
ICDAR
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
143
click to vote
SIAMSC
2010
15 years 15 days ago
2010
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
203
click to vote
SIAMCOMP
2012
13 years 8 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...