10414 search results - page 139 / 2083 » An efficient algorithm for Co-segmentation |
176
click to vote
DAWAK
1999
Springer
15 years 10 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
161
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
133
click to vote
JCST
2006
15 years 6 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
280
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
277
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...