103 search results - page 2 / 21 » Pattern avoidance in binary trees |
TCS
2011
13 years 7 days ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
MCS
2011
Springer
13 years 8 days ago
2011
Springer
: The modeling of a fully populated 3D tree able to regulate dynamically remains a relatively unexplored field. A non-dimensional representation of “autoregulation” coupled wit...
ACCV
2010
Springer
13 years 10 days ago
2010
Springer
Many state-of-the-art face recognition algorithms use image descriptors based on features known as Local Binary Patterns (LBPs). While many variations of LBP exist, so far none of ...
JACIII
2006
13 years 5 months ago
2006
TCAD
2008
13 years 5 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...