Sciweavers

500 search results - page 17 / 100
» On the Hardness of Being Truthful
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua
ICMCS
2006
IEEE
117views Multimedia» more  ICMCS 2006»
14 years 1 months ago
DIBR-Based 3D Videos using Non Video Rate Range Image Stream
The fundamental assumption of 3D videos using depth-imagebased rendering is the full availability of range images at video rate. In this work we alleviate this hard demand and ass...
Xiaoyi Jiang, Martin Lambers
AAAI
2010
13 years 8 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
Andrey Kolobov, Mausam, Daniel S. Weld
IJCAI
2001
13 years 8 months ago
Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges
Generalized Vickrey mechanisms have received wide attention in the literature because they are efficient and strategyproof, i.e. truthful bidding is optimal whatever the bids of o...
David C. Parkes, Jayant Kalagnanam, Marta Eso
SIGECOM
2010
ACM
128views ECommerce» more  SIGECOM 2010»
13 years 7 months ago
Equilibria of plurality voting with abstentions
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
Yvo Desmedt, Edith Elkind