1552 search results - page 294 / 311 » On the Complexity of Constant Propagation |
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
PODC
2003
ACM
15 years 5 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
DIS
2003
Springer
15 years 5 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
88
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...