3616 search results - page 163 / 724 » Conditional Memory Ordering |
166
click to vote
DEXAW
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a method to index objects moving on the plane in order to efficiently answer range queries about their position in the future. This problem is motivated by real-life a...
150
click to vote
ESOP
2000
Springer
15 years 9 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
153
click to vote
PLILP
1994
Springer
15 years 9 months ago
1994
Springer
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
176
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1,...
257
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...