Sciweavers

1616 search results - page 147 / 324
» Robust game theory
Sort
View
COLING
1994
15 years 7 months ago
Interlanguage Signs And Lexical Transfer Errors
A theoryof interlanguage(IL)lexiconsis outlined,with emphasis on IL lexical entries, based on the HPSG notion of lexical sign. This theory accounts for idiosyncratic or lexical tr...
Atle Ro
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 5 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
PODC
2004
ACM
15 years 11 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
ICCV
2001
IEEE
16 years 7 months ago
Robust Principal Component Analysis for Computer Vision
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares...
Fernando De la Torre, Michael J. Black
ICASSP
2010
IEEE
15 years 6 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa