736 search results - page 101 / 148 » Distinguishing geometric graphs |
CORR
2011
Springer
14 years 6 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
107
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presen...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...