574 search results - page 106 / 115 » Approximation Algorithms for Free-Label Maximization |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...