Sciweavers

7811 search results - page 1475 / 1563
» computing 2004
Sort
View
ICALP
2004
Springer
15 years 8 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICALP
2004
Springer
15 years 8 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 8 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
CCE
2004
15 years 2 months ago
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches...
Diego C. Cafaro, Jaime Cerdá
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
16 years 3 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
« Prev « First page 1475 / 1563 Last » Next »