494 search results - page 33 / 99 » Heap Building Bounds |
143
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
161
Voted
ESA
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
138
Voted
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular...
124
click to vote
EUROCOLT
1999
Springer
15 years 8 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
229
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...