11211 search results - page 1974 / 2243 » Rank-Sensitive Data Structures |
126
Voted
ICCS
2005
Springer
15 years 9 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...
126
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalized multiprotocol label switching) to overcome the scalability problems existing in current i...
118
click to vote
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
— We have designed and constructed a modular platform for use in compact wireless sensing. This platform is based around a series of circuit boards (or panes), each of which inst...
126
click to vote
IPSN
2005
Springer
15 years 9 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...
141
Voted
ISAAC
2005
Springer
15 years 9 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...