1024 search results - page 51 / 205 » The Generalized PatchMatch Correspondence Algorithm |
98
Voted
IJCAI
2007
15 years 4 months ago
2007
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
117
Voted
ICAI
2003
15 years 4 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
138
Voted
AMAI
2008
Springer
15 years 2 months ago
2008
Springer
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
134
Voted
COMBINATORICS
2000
15 years 2 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...