Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
In this article a formal model applying REST architectural principles to the description of semantic web services is introduced, including the discussion of its syntax and operati...
We present an approach for editing shadows in all-frequency lighting environments. To support artistic control, we propose to decouple shadowing from lighting and focus on providi...
Juraj Obert, Fabio Pellacini, Sumanta N. Pattanaik