500 search results - page 6 / 100 » On the Hardness of Being Truthful |
JSAT
2006
13 years 7 months ago
2006
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with i...
MICCAI
2002
Springer
14 years 8 months ago
2002
Springer
We propose a multimodal free form registration algorithm based on maximization of mutual information. Images to be aligned are modeled as a viscous fluid that deforms under the inf...
AAIM
2005
Springer
14 years 28 days ago
2005
Springer
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
TREC
2004
13 years 8 months ago
2004
For the TREC 2004 Novelty track, UMass participated in all four tasks. Although finding relevant sentences was harder this year than last, we continue to show marked improvements ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...