970 search results - page 119 / 194 » Adaptive Analysis of On-line Algorithms |
116
Voted
WAW
2007
Springer
15 years 6 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
104
Voted
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
103
Voted
WOB
2003
15 years 1 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
114
Voted
SIAMSC
2008
15 years 15 days ago
2008
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
95
Voted
CN
2004
15 years 13 days ago
2004
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...