Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree top...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...