736 search results - page 108 / 148 » Distinguishing geometric graphs |
107
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
AML
2005
14 years 11 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
IJCV
2012
13 years 2 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
102
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...