Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
Event/object classification and recognition is an extremely challenging problem, particularly when the query or stored data undergo an affine transformation due to camera motion. ...
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...