Sciweavers

3415 search results - page 656 / 683
» Lower bounds on kernelization
Sort
View
173
Voted
CP
2001
Springer
15 years 10 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
ICDCS
2000
IEEE
15 years 10 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
ICDCS
2000
IEEE
15 years 10 months ago
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivas...
146
Voted
INFOCOM
2000
IEEE
15 years 10 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin