Sciweavers

2924 search results - page 324 / 585
» Lower Bounds in Distributed Computing
Sort
View
TIT
2008
105views more  TIT 2008»
15 years 3 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
SCHEDULING
2011
14 years 11 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
ICS
2011
Tsinghua U.
14 years 8 months ago
Page placement in hybrid memory systems
Phase-Change Memory (PCM) technology has received substantial attention recently. Because PCM is byte-addressable and exhibits access times in the nanosecond range, it can be used...
Luiz E. Ramos, Eugene Gorbatov, Ricardo Bianchini
147
Voted
KI
2008
Springer
15 years 4 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
ICML
2008
IEEE
16 years 5 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar