Sciweavers

12519 search results - page 2503 / 2504
» Approximation Problems Categories
Sort
View
EUROSYS
2006
ACM
14 years 5 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
MSWIM
2009
ACM
14 years 3 months ago
Directional neighbor discovery in 60 GHz indoor wireless networks
The unlicensed 60 GHz band brings the promise of multi-gigabit data rates to support new applications such as high definition video over wireless links. Signal propagation in the...
Jianxia Ning, Tae-Suk Kim, Srikanth V. Krishnamurt...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 3 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
SAC
2004
ACM
14 years 1 months ago
GD-GhOST: a goal-oriented self-tuning caching algorithm
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
« Prev « First page 2503 / 2504 Last » Next »