780 search results - page 148 / 156 » Robustness and Randomness |
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SENSYS
2003
ACM
14 years 2 months ago
2003
ACM
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
AUSAI
2003
Springer
14 years 2 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...