Sciweavers

1933 search results - page 380 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
FOCS
1997
IEEE
13 years 11 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
ICS
2010
Tsinghua U.
14 years 4 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 2 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
SIGCOMM
2009
ACM
14 years 2 months ago
DIRC: increasing indoor wireless capacity using directional antennas
The demand for wireless bandwidth in indoor environments such as homes and offices continues to increase rapidly. Although wireless technologies such as MIMO can reach link throug...
Xi Liu, Anmol Sheth, Michael Kaminsky, Konstantina...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 22 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust