1327 search results - page 197 / 266 » Path following algorithm for the graph matching problem |
114
click to vote
TCS
2008
15 years 1 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
85
Voted
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
117
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
223
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...