Sciweavers

7544 search results - page 1407 / 1509
» Network Forensics Analysis
Sort
View
140
Voted
PODC
2009
ACM
15 years 10 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
119
Voted
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 10 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
LCTRTS
2009
Springer
15 years 10 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
151
Voted
SIGCOMM
2009
ACM
15 years 10 months ago
Economic issues in shared infrastructures
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
Costas Courcoubetis, Richard R. Weber
CLADE
2008
IEEE
15 years 10 months ago
SWARM: a scientific workflow for supporting bayesian approaches to improve metabolic models
With the exponential growth of complete genome sequences, the analysis of these sequences is becoming a powerful approach to build genome-scale metabolic models. These models can ...
Xinghua Shi, Rick Stevens
« Prev « First page 1407 / 1509 Last » Next »