4541 search results - page 823 / 909 » Cache-Oblivious Algorithms and Data Structures |
150
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This article presents special quadrilateral quadratic refinement elements, which provide geometry and field continuity across Tjunctions where two elements are connecte...
160
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
173
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
154
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
170
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
We present a novel method for interactive retrieval of 3D shapes using physical objects. Our method is based on simple physical 3D interaction with a set of tangible blocks. As th...