16430 search results - page 365 / 3286 » On Computable Tree Functions |
162
click to vote
PR
2006
15 years 6 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
148
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
216
Voted
ARITH
2001
IEEE
15 years 9 months ago
2001
IEEE
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
183
Voted
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...