Sciweavers

549 search results - page 91 / 110
» Computational Bundling for Auctions
Sort
View
RAS
2010
142views more  RAS 2010»
13 years 8 months ago
Closing the loop in appearance-guided omnidirectional visual odometry by using vocabulary trees
In this paper, we present a method that allows us to recover the trajectory of a vehicle purely from monocular omnidirectional images very accurately. The method uses a combination...
Davide Scaramuzza, Friedrich Fraundorfer, Marc Pol...
COLOGNETWENTE
2010
13 years 6 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
12 years 8 days ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
AAMAS
2010
Springer
13 years 10 months ago
Evolutionary mechanism design: a review
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
Steve Phelps, Peter McBurney, Simon Parsons
CVPR
2012
IEEE
12 years 8 days ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing