32545 search results - page 291 / 6509 » Data Structures and Algorithms |
118
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
138
click to vote
SOFSEM
2004
Springer
15 years 9 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
142
click to vote
ACMSE
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
142
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
162
click to vote
3DIM
2007
IEEE
15 years 10 months ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...