Sciweavers

284 search results - page 16 / 57
» What Matchings Can Be Stable
Sort
View
ECCC
2008
108views more  ECCC 2008»
13 years 8 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
CGF
2010
167views more  CGF 2010»
13 years 5 months ago
Chain Shape Matching for Simulating Complex Hairstyles
Animations of hair dynamics greatly enrich the visual attractiveness of human characters. Traditional simulation techniques handle hair as clumps or continuum for efficiency; howe...
Witawat Rungjiratananon, Yoshihiro Kanamori, Tomoy...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 8 months ago
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
Michele d'Amico, Patrizio Frosini, Claudia Landi
CVPR
2012
IEEE
11 years 11 months ago
On SIFTs and their scales
Scale invariant feature detectors often find stable scales in only a few image pixels. Consequently, methods for feature matching typically choose one of two extreme options: mat...
Tal Hassner, Viki Mayzels, Lihi Zelnik-Manor
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 5 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...