1274 search results - page 120 / 255 » Graph lambda theories |
102
click to vote
LICS
2010
IEEE
15 years 19 days ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
147
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned n...
156
Voted
MST
2010
14 years 9 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
136
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
104
Voted
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...