Sciweavers

549 search results - page 31 / 110
» Computational Bundling for Auctions
Sort
View
ICCV
2007
IEEE
16 years 1 months ago
Efficient Computation of the Inverse Gradient on Irregular Domains
The inverse gradient problem, finding a scalar field f with a gradient near a given vector field g on some bounded and connected domain Rn , can be solved by means of a Poisson ...
Gunnar Farnebäck, Hans Knutsson, Joakim Rydel...
ORL
2008
90views more  ORL 2008»
14 years 11 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
ICRA
2010
IEEE
141views Robotics» more  ICRA 2010»
14 years 10 months ago
A constricted bundle adjustment parameterization for relative scale estimation in visual odometry
— In this paper we address the problem of visual motion estimation (visual odometry) from a single vehicle mounted camera. One of the basic issues of visual odometry is relative ...
Friedrich Fraundorfer, Davide Scaramuzza, Marc Pol...
SC
2004
ACM
15 years 5 months ago
Optimal File-Bundle Caching Algorithms for Data-Grids
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
Ekow J. Otoo, Doron Rotem, Alexandru Romosan
FC
2009
Springer
118views Cryptology» more  FC 2009»
15 years 6 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...