Sciweavers

142 search results - page 11 / 29
» A Private Stable Matching Algorithm
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
CVPR
2005
IEEE
14 years 10 months ago
Coherent Regions for Concise and Stable Image Description
We present a new method for summarizing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise...
Jason J. Corso, Gregory D. Hager
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
13 years 7 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
CVPR
2010
IEEE
14 years 5 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
AAAI
2012
11 years 11 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang