Sciweavers

26 search results - page 2 / 6
» Some Improvements on Multipartite Table Methods
Sort
View
CAAN
2007
Springer
13 years 11 months ago
Improving Topological Routing in N2R Networks
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
José M. Gutiérrez López, Rub&...
WAIM
2004
Springer
13 years 10 months ago
DHT Based Searching Improved by Sliding Window
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Som...
Shen Huang, Gui-Rong Xue, Xing Zhu, Yan-Feng Ge, Y...
TIT
1998
79views more  TIT 1998»
13 years 5 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
SAC
2011
ACM
12 years 8 months ago
Site-autonomous distributed semantic caching
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
INFOCOM
2000
IEEE
13 years 9 months ago
On the Aggregatability of Multicast Forwarding State
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
David Thaler, Mark Handley