494 search results - page 52 / 99 » Heap Building Bounds |
97
Voted
INFOCOM
2003
IEEE
15 years 4 months ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
NCA
2003
IEEE
15 years 4 months ago
2003
IEEE
A lot of research work has recently focused on the exploitation of the DiffServ framework towards building reliable networking services that provide deterministic quality guarante...
105
click to vote
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
ISAAC
2001
Springer
15 years 3 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
82
Voted
IWANN
2001
Springer
15 years 3 months ago
2001
Springer
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...