Sciweavers

4880 search results - page 236 / 976
» Mechanism Design by Creditability
Sort
View
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
16 years 4 days ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
SIGECOM
2010
ACM
161views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Computation and incentives in combinatorial public projects
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
Dave Buchfuhrer, Michael Schapira, Yaron Singer
DAC
1996
ACM
15 years 10 months ago
Hot-Carrier Reliability Enhancement via Input Reordering and Transistor Sizing
Hot-carrier eects and electromigration are the two important failure mechanisms that signi cantly impact the long-term reliability of high-density VLSI ICs. In this paper, we prese...
Aurobindo Dasgupta, Ramesh Karri
NIPS
2004
15 years 8 months ago
Boosting on Manifolds: Adaptive Regularization of Base Classifiers
In this paper we propose to combine two powerful ideas, boosting and manifold learning. On the one hand, we improve ADABOOST by incorporating knowledge on the structure of the dat...
Balázs Kégl, Ligen Wang
JOT
2006
106views more  JOT 2006»
15 years 6 months ago
ABS++: Assertion Based Subtyping in C++
For software engineering to meet today's challenges, well designed reuse and composition mechanisms must be established in both theory and practice. Starting roughly ten year...
Herbert Toth