Sciweavers

500 search results - page 21 / 100
» On the Hardness of Being Truthful
Sort
View
ATAL
2007
Springer
15 years 3 months ago
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
Florin Constantin, David C. Parkes
CVPR
2006
IEEE
15 years 3 months ago
Scalable Recognition with a Vocabulary Tree
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers...
David Nistér, Henrik Stewénius
PVLDB
2008
107views more  PVLDB 2008»
14 years 8 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu
81
Voted
PAMI
2010
202views more  PAMI 2010»
14 years 7 months ago
DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...
Engin Tola, Vincent Lepetit, Pascal Fua
170
Voted
PERVASIVE
2011
Springer
14 years 9 days ago
Identifying Important Places in People's Lives from Cellular Network Data
People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is cru...
Sibren Isaacman, Richard Becker, Ramón C&aa...