1688 search results - page 46 / 338 » The Complexity of Rationalizing Matchings |
NIPS
2008
13 years 11 months ago
2008
Classical game theoretic approaches that make strong rationality assumptions have difficulty modeling human behaviour in economic games. We investigate the role of finite levels o...
JDA
2008
13 years 10 months ago
2008
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (...
TCSV
2010
13 years 4 months ago
2010
Motion compensated prediction plays a vital role in achieving enormous video compression efficiency in advanced video coding standards. Most practical motion compensated prediction...
ECCV
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...