96 search results - page 2 / 20 » Structure and linear time recognition of 3-leaf powers |
TCS
1998
13 years 6 months ago
1998
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
COLOGNETWENTE
2009
13 years 7 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
TALG
2008
13 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
TSP
2012
12 years 1 months ago
2012
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
PR
2007
13 years 5 months ago
2007
Face recognition is a challenging task in computer vision and pattern recognition. It is well-known that obtaining a low-dimensional feature representation with enhanced discrimin...