Sciweavers

2168 search results - page 256 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
COMPGEOM
2006
ACM
15 years 10 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
MSWIM
2005
ACM
15 years 10 months ago
Content and service replication strategies in multi-hop wireless mesh networks
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
Shudong Jin, Limin Wang
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 6 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
BMCBI
2006
143views more  BMCBI 2006»
15 years 4 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...