970 search results - page 70 / 194 » cases 2011 |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
—When is optimal estimation linear? It is well-known that, in the case of a Gaussian source contaminated with Gaussian noise, a linear estimator minimizes the mean square estimat...
DAM
2011
13 years 5 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...