Sciweavers

297 search results - page 11 / 60
» On the Fastest Vickrey Algorithm
Sort
View
ISPD
2005
ACM
168views Hardware» more  ISPD 2005»
14 years 28 days ago
Capo: robust and scalable open-source min-cut floorplacer
In this invited note we describe Capo, an open-source software tool for cell placement, mixed-size placement and floorplanning with emphasis on routability. Capo is among the fas...
Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Hay...
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
14 years 18 days ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
COLOGNETWENTE
2010
13 years 6 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
CVPR
2012
IEEE
11 years 9 months ago
Seeded watershed cut uncertainty estimators for guided interactive segmentation
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
Christoph N. Straehle, Ullrich Köthe, Graham ...