Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
We consider decentralized multiantenna cognitive radio networks where the secondary (cognitive) users are granted simultaneous spectrum access along with the license-holding (prima...
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...