We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
An increase in the performance of deteriorating systems can be achieved through the adoption of suitable maintenance policies. One of the most popular maintenance policies is the ...
In this work a joint clock recovery (CR) and equalization scheme for short burst transmissions is presented. The joint optimization performance may be pursued by means of both data...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...