Lockand wait-free data structures can be constructed in a generic way. However, when complex operations are involved, their practical use is rather limited due to high performance overheads and, in some settings, difficult to fulfil object lifecycles. While working on a synchronous inter-processor communication (IPC) path for multicore systems, we stumbled over a clever piece of code that did f...

Using handwritten characters we address two questions (i) what is the group identification performance of different alphabets (upper and lower case) and (ii) what are the best characters for the verification task (same writer/different writer discrimination) knowing demographic information about the writer such as age,sex or country of birth. The Bhattacharya distance is used to rank different ...

Writer identification and verification has been studied over the past decade due to the high demand of such implementations in a wide variety of offline handwritten data applications. Among the applications are verification of the identity of a person whom he or she claimed to be and forensic and historic document analysis in identifying the identity of the writer of the documents. This paper p...

Writer identification (writer-id), an important field in biometrics, aims to identify a writer by their handwriting. Identification existing writer-id studies requires complete document or text, limiting the scalability and flexibility of realistic applications. To make application more practical (e.g., on mobile devices), we focus novel problem, letter-level online writer-id, which only few tr...