16430 search results - page 247 / 3286 » On Computable Tree Functions |
135
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
166
click to vote
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
105
click to vote
SWAT
1990
Springer
15 years 8 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
108
click to vote
NIPS
1996
15 years 5 months ago
1996
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
144
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....