2487 search results - page 175 / 498 » Partitions of Graphs into Trees |
123
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
119
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
122
Voted
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with s...
142
Voted
ECML
2007
Springer
15 years 9 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
135
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...