2060 search results - page 194 / 412 » Some Applications of Coding Theory in Computational Complexi... |
KDD
2010
ACM
14 years 8 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
102
click to vote
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
84
Voted
SOSP
2007
ACM
15 years 7 months ago
2007
ACM
This paper describes an efficient and robust approach to provide a safe execution environment for an entire operating system, such as Linux, and all its applications. The approach...
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...