11213 search results - page 397 / 2243 » Low-contention data structures |
148
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
168
click to vote
CSDA
2010
15 years 5 months ago
2010
The goal of this work is to study the asymptotic and finite sample properties of an estimator of a nonlinear regression function when errors are spatially correlated, and when the...
185
click to vote
ICANN
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
207
click to vote
DATESO
2009
15 years 4 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
178
click to vote
JLP
2010
15 years 1 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...