Sciweavers

2095 search results - page 315 / 419
» Improved pebbling bounds
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa
INFOCOM
2009
IEEE
14 years 4 months ago
Power-Aware Speed Scaling in Processor Sharing Systems
—Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, whic...
Adam Wierman, Lachlan L. H. Andrew, Ao Tang
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 4 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
WABI
2009
Springer
14 years 4 months ago
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
We develop, analyze and experiment with a new tool, called madmx, which extracts frequent motifs, possibly including don’t care characters, from biological sequences. We introduc...
Roberto Grossi, Andrea Pietracaprina, Nadia Pisant...
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 4 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing