Sciweavers

10289 search results - page 402 / 2058
» Standard bases in K
Sort
View
IOR
2002
135views more  IOR 2002»
15 years 6 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
CISS
2007
IEEE
16 years 1 months ago
Data Dissemination in Wireless Broadcast Channels: Network Coding or Cooperation
—Network coding and cooperative diversity have each extensively been explored in the literature as a means to substantially improve the performance of wireless networks. Yet, lit...
Ivana Stojanovic, Masoud Sharif, David Starobinski
IEEEPACT
2007
IEEE
16 years 1 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
CRYPTO
2007
Springer
143views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
Nick Howgrave-Graham
166
Voted
ICDCS
1997
IEEE
15 years 11 months ago
Distributed Recovery with K-Optimistic Logging
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...
Yi-Min Wang, Om P. Damani, Vijay K. Garg