2570 search results - page 199 / 514 » Fast Algorithms For The Computation Of Ranklets |
140
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
157
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
128
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
157
click to vote
DCOSS
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
115
click to vote
DICTA
2003
15 years 5 months ago
2003
Abstract. This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The al...