Sciweavers

5221 search results - page 101 / 1045
» An On-line Problem Database
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 10 months ago
Cell-probe lower bounds for the partial match problem
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...
ICIP
2009
IEEE
15 years 11 months ago
Localized Null Space Representation For Dynamic Updating And Downdating In Image And Video Databases
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. ...
APWEB
2006
Springer
15 years 1 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
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 ...
Kuo-Yu Huang, Chia-Hui Chang
ICDCS
2009
IEEE
14 years 7 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
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...
LREC
2010
206views Education» more  LREC 2010»
14 years 11 months ago
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
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...
Eneldo Loza Mencía, Johannes Fürnkranz