Sciweavers

806 search results - page 115 / 162
» Lower Bounds on Correction Networks
Sort
View
MIDDLEWARE
2005
Springer
15 years 11 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 10 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
ISPAN
1999
IEEE
15 years 10 months ago
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
Jennifer M. Schopf, Francine Berman
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ICASSP
2010
IEEE
15 years 6 months ago
Wideband spectral estimation from compressed measurements exploiting spectral a priori information in Cognitive Radio systems
In Cognitive Radio scenarios channelization information from primary network may be available to the spectral monitor. Under this assumption we propose a spectral estimation algor...
Gonzalo Vazquez-Vilar, Roberto López-Valcar...