Sciweavers

175 search results - page 22 / 35
» Bounds for Permutation Rate-Distortion
Sort
View
PODC
2003
ACM
14 years 27 days ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
AOR
2007
107views more  AOR 2007»
13 years 7 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
TIT
2010
90views Education» more  TIT 2010»
13 years 2 months ago
Correcting limited-magnitude errors in the rank-modulation scheme
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
Itzhak Tamo, Moshe Schwartz
VLSID
2002
IEEE
95views VLSI» more  VLSID 2002»
14 years 8 months ago
A Novel Method to Improve the Test Efficiency of VLSI Tests
This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal o...
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro