Sciweavers

568 search results - page 96 / 114
» New bounds for the Cebysev functional
Sort
View
OSDI
2002
ACM
14 years 7 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...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
KBSE
2005
IEEE
14 years 1 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
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
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
13 years 11 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan