500 search results - page 56 / 100 » On the Hardness of Being Truthful |
108
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
120
click to vote
ACL
2012
13 years 2 months ago
2012
The named entity disambiguation task is to resolve the many-to-many correspondence between ambiguous names and the unique realworld entity. This task can be modeled as a classifi...
124
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
TCC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
FASE
2010
Springer
15 years 6 months ago
2010
Springer
Multithreaded concurrent programs often exhibit bugs due to unintended interferences among the concurrent threads. Such bugs are often hard to reproduce because they typically hap...