Sciweavers

2796 search results - page 460 / 560
» A time structure based software reliability model
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
MOBIHOC
2009
ACM
16 years 6 months ago
Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
I-Hong Hou, P. R. Kumar
SIGMETRICS
2002
ACM
104views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Improving cluster availability using workstation validation
We demonstrate a framework for improving the availability of cluster based Internet services. Our approach models Internet services as a collection of interconnected components, e...
Taliver Heath, Richard P. Martin, Thu D. Nguyen
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
16 years 3 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 6 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf