1321 search results - page 114 / 265 » Quadratic forms on graphs |
96
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
116
Voted
PARLE
1987
15 years 4 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
108
click to vote
FASE
2008
Springer
15 years 2 months ago
2008
Springer
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph...
117
click to vote
NIPS
2008
15 years 2 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
129
click to vote
CATS
2006
15 years 2 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...