Sciweavers

103 search results - page 5 / 21
» Pattern avoidance in binary trees
Sort
View
CVPR
2011
IEEE
13 years 5 months ago
Mining Discriminative Co-occurrence Patterns for Visual Recognition
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action rec...
Junsong Yuan, Ming Yang, Ying Wu
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 3 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
13 years 9 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 10 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
DM
1999
122views more  DM 1999»
13 years 9 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow