Sciweavers

282 search results - page 15 / 57
» Efficient bundle sorting
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Resource allocation among agents with preferences induced by factored MDPs
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
Dmitri A. Dolgov, Edmund H. Durfee
AAAI
2000
13 years 8 months ago
Robust Combinatorial Auction Protocol against False-Name Bids
This paper presents a new combinatorial auction protocol (LDS protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commer...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
CVPR
2007
IEEE
14 years 9 months ago
Inferring Temporal Order of Images From 3D Structure
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
Grant Schindler, Frank Dellaert, Sing Bing Kang
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 8 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
DAWAK
1999
Springer
13 years 11 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel