187 search results - page 15 / 38 » On the uniform edge-partition of a tree |
82
Voted
AAAI
1996
14 years 10 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
AFRIGRAPH
2006
ACM
15 years 3 months ago
2006
ACM
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
100
click to vote
WEA
2010
Springer
15 years 4 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 ...