Sciweavers

256 search results - page 50 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
SPAA
1999
ACM
14 years 1 days ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
OSDI
2002
ACM
14 years 8 months ago
Cooperative I/O: A Novel I/O Semantics for Energy-Aware Applications
In this paper we demonstrate the benefits of application involvement in operating system power management. We present Coop-I/O, an approach to reduce the power consumption of devi...
Andreas Weissel, Bjórn Beutel, Frank Bellos...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 11 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck