Sciweavers

1414 search results - page 28 / 283
» Cover Time and Broadcast Time
Sort
View
COMCOM
2007
89views more  COMCOM 2007»
13 years 10 months ago
Convergence of periodic broadcasting and video-on-demand
Research on video-on-demand transmissions is essentially divided into periodic broadcasting methods and on-demand methods. Periodic broadcasting is aimed to schedule transmissions...
Juan Segarra, Vicent Cholvi
FOCS
2008
IEEE
14 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
MDM
2004
Springer
138views Communications» more  MDM 2004»
14 years 3 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald
IPPS
1999
IEEE
14 years 2 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
14 years 3 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre