Sciweavers

24 search results - page 4 / 5
» Constant time factors do matter
Sort
View
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 25 days ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ICDCSW
2009
IEEE
14 years 28 days ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
ISCC
2007
IEEE
100views Communications» more  ISCC 2007»
14 years 17 days ago
End-to-End Mean Bandwidth Estimation as a Function of Packet Length in Mobile Ad Hoc Networks
Many methods for end-to-end bandwidth estimation on wired networks assume that link capacities are constant and that all cross-traffic interaction occurs through queuing delays at...
Marco A. Alzate, Maria P. Salamanca, Néstor...
INFOCOM
2009
IEEE
14 years 28 days ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh