16430 search results - page 316 / 3286 » On Computable Tree Functions |
193
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
159
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
154
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
160
click to vote
SIBGRAPI
2008
IEEE
15 years 11 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
162
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...