Sciweavers

1404 search results - page 165 / 281
» On General Laws of Complex Networks
Sort
View
PODC
2009
ACM
15 years 11 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...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 4 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
EWSN
2007
Springer
16 years 4 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl
IPSN
2010
Springer
15 years 11 months ago
Distributed genetic evolution in WSN
Wireless Sensor Actuator Networks (WSANs) extend wireless sensor networks through actuation capability. Designing robust logic for WSANs however is challenging since nodes can aï¬...
Philip Valencia, Peter Lindsay, Raja Jurdak
IISWC
2008
IEEE
15 years 11 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley