Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
A method of comparing and identifying two patterns is proposed based on the accidental coincidence probability of the patterns' features. The probability is calculated under ...
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....