Sciweavers

1408 search results - page 157 / 282
» Dynamical Tensor Approximation
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 2 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
CG
2008
Springer
14 years 12 months ago
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
Rémi Coulom
IJCAI
2007
14 years 11 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
PDPTA
2007
14 years 11 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...
AAAI
1996
14 years 11 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette