Sciweavers

7 search results - page 1 / 2
» ride 1998
Sort
View
FOCS
1998
IEEE
13 years 8 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari
RIDE
1998
IEEE
13 years 8 months ago
A Scalable Approach to Continuous-Media Processing
Techniques that emphasize software reuse and scalability are becoming more important than ever. In this paper we present a component-basedmodel for continuous-mediaapplications. C...
Dragos-Anton Manolescu, Klara Nahrstedt
RIDE
1998
IEEE
13 years 8 months ago
Design of Multi-user Editing Servers for Continuous Media
Based on a fifteen month investigation of a post production facilities for both the entertainment industry and broadcasters, we identified a number of challenges with the design an...
Seon Ho Kim, Shahram Ghandeharizadeh
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
13 years 8 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
RIDE
1998
IEEE
13 years 8 months ago
Generating Hypermedia Documents from Transcriptions of Television Programs Using Parallel Text Alignment
This paper presents a method of automatically creating hypermedia documents from conventional transcriptions of television programs. Using parallel text alignment techniques, the ...
David C. Gibbon