The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
When mosaicking two adjacent orthophotos, the transition from one orthophoto to the other is cannot be seen. The requirements of such an optimal seamline include high color similarity and high texture similarity. In this paper, a novel method integrated snakes and bresenham is presented. The calculation of photometric energy in the snake model considers not only the discrete points, but all the points...
Influence maximization is the problem of finding a small set of most influential nodes in a social network so that their aggregated influence in the network is maximized. In this paper, we study influence maximization in the linear threshold model, one of the important models formalizing the behavior of influence propagation in social networks. We first show that computing exact influence in general...
The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem in wireless sensor networks with directional sensors. First, we introduce the directional coverage graph to model barrier coverage with directional sensors. Based on this graph model, we present an integer linear programming formulation...
Wireless mesh nodes equipping multi-radio interfaces on each node and using multi-channel for transmission can greatly enhance the network performance. In this paper, a genetic algorithm, genetic tabu search, was presented to solve the channel assignment problem. The algorithm was evaluated by simulation on NS2 and compared with greedy and multi-radio unification protocol algorithms. Simulation results...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.