8141 search results - page 1408 / 1629 » Higher Order Generalization |
224
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
186
click to vote
SASN
2004
ACM
15 years 12 months ago
2004
ACM
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
156
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
181
click to vote
ECEASST
2006
15 years 6 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...