205 search results - page 34 / 41 » Efficient Algorithms for Universal Portfolios |
84
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
ICSE
2004
IEEE-ACM
15 years 9 months ago
2004
IEEE-ACM
Immersive, interactive applications grouped under the concept of Immersipresence require on-line processing and mixing of multimedia data streams and structures. One critical issu...
78
Voted
SAINT
2003
IEEE
15 years 2 months ago
2003
IEEE
The problem of identifying patterns from system call trails of UNIX processes to better model application behavior has been investigated intensively. Most existing approaches focu...
AI
2004
Springer
14 years 9 months ago
2004
Springer
al Abstraction Luca Chittaro and Roberto Ranon Department of Mathematics and Computer Science, University of Udine, via delle Scienze 206, 33100 Udine, Italy ion has been advocat...