Sciweavers

1414 search results - page 43 / 283
» Cover Time and Broadcast Time
Sort
View
WIA
2004
Springer
14 years 3 months ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 10 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 10 months ago
Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...
Julien Robert, Nicolas Schabanel
JPDC
2006
148views more  JPDC 2006»
13 years 10 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
SAMT
2007
Springer
96views Multimedia» more  SAMT 2007»
14 years 4 months ago
LIVE: Semantic-based Multi-Stream Broadcasting of Media Events
—Broadcasting of media events is a real-time action demanding reliable just in time decisions based on the current content of incoming video streams and the availability of backg...
Tobias Bürger, Rupert Westenthaler, Christian...