Sciweavers

289 search results - page 19 / 58
» Simple COMA Node Implementations
Sort
View
PDPTA
1996
13 years 10 months ago
Document Retrieval Performance on Parallel Systems
The problem of eciently retrieving and ranking documents from a huge collection according to their relevance to a research topic is addressed. A broad class of queries is de ned a...
David Hawking
PERCOM
2009
ACM
14 years 3 months ago
On the Accuracy of RFID-based Localization in a Mobile Wireless Network Testbed
Abstract—The extensive recent research in protocols development for wireless networks must be complemented with simple yet efficient prototyping and evaluation mechanism. MiNT-2...
Vikram P. Munishwar, Shailendra Singh 0003, Xiaosh...
ACNS
2008
Springer
103views Cryptology» more  ACNS 2008»
14 years 3 months ago
Pushback for Overlay Networks: Protecting Against Malicious Insiders
Peer-to-Peer (P2P) overlay networks are a flexible way of creating decentralized services. Although resilient to external Denial of Service attacks, overlay networks can be render...
Angelos Stavrou, Michael E. Locasto, Angelos D. Ke...
CORR
2010
Springer
437views Education» more  CORR 2010»
13 years 6 months ago
A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs
Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic na...
Binod Kumar Pattanayak, Alok Kumar Jagadev, Manoj ...
INFOCOM
2011
IEEE
13 years 7 days ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...