118 search results - page 11 / 24 » A Generalized Version of the McMullen Domain |
DOCENG
2006
ACM
15 years 4 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
80
Voted
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
93
Voted
POPL
2012
ACM
13 years 5 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
112
click to vote
ATAL
2011
Springer
13 years 10 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising i...