2925 search results - page 367 / 585 » Information Complexity of Online Problems |
134
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— Multi-tier Internet service clusters often contain complex calling dependencies among service components spreading across cluster nodes. Without proper handling, partial failur...
186
Voted
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
181
click to vote
VLDB
2001
ACM
15 years 9 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
146
click to vote
SIGGRAPH
2000
ACM
15 years 9 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...
169
click to vote
BROADNETS
2004
IEEE
15 years 8 months ago
2004
IEEE
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...