334 search results - page 57 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
106
click to vote
WISE
2007
Springer
15 years 3 months ago
2007
Springer
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
111
click to vote
DATAMINE
1999
14 years 9 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
IROS
2007
IEEE
15 years 3 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...