Sciweavers

867 search results - page 122 / 174
» Network Robustness and Graph Topology
Sort
View
ALGOSENSORS
2009
Springer
13 years 5 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
13 years 9 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
ICALP
2009
Springer
14 years 8 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
ASPDAC
2012
ACM
241views Hardware» more  ASPDAC 2012»
12 years 3 months ago
Post-fabrication reconfiguration for power-optimized tuning of optically connected multi-core systems
Abstract— Integrating optical interconnects into the nextgeneration multi-/many-core architecture has been considered a viable solution to addressing the limitations in throughpu...
Yan Zheng, Peter Lisherness, Saeed Shamshiri, Amir...
ACSAC
2010
IEEE
12 years 11 months ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon