44 search results - page 2 / 9 » Fractional Kernels in Digraphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recent experimental work has suggested that the neural firing rate can be interpreted as a fractional derivative, at least when signal variation induces neural adaptation. Here, ...
JCSS
2010
13 years 7 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
DAM
2008
13 years 8 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
JMM2
2008
13 years 8 months ago
2008
This paper presents a technique for face recognition which uses wavelet transform to derive desirable facial features. Three level decompositions are used to form the pyramidal mul...