Sciweavers

4302 search results - page 714 / 861
» Index Pairs Algorithms
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
NMR
2004
Springer
14 years 2 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber
ICPPW
2003
IEEE
14 years 2 months ago
Perfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...
INFOCOM
2003
IEEE
14 years 2 months ago
Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach
—Wireless communications using ad hoc networks are receiving an increasing interest. The most attractive feature of ad hoc networks is the flexibility. The network is set up by ...
Peter Värbrand, Di Yuan, Patrik Björklun...
INFOCOM
2003
IEEE
14 years 2 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid