680 search results - page 42 / 136 » A randomized embedding algorithm for trees |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
ALGOSENSORS
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...