672 search results - page 8 / 135 » A General Solution to the Graph History Interaction Problem |
AMAI
2002
Springer
13 years 7 months ago
2002
Springer
: Mereotopology faces problems when its methods are extended to deal with time and change. We offer a new solution to these problems, based on a theory of partitions of reality wh...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
We describe a visual interactive framework that supports the computation of syntactic unifiers of expressions with variables. Unification is specified via built-in transformatio...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
AI
2003
Springer
14 years 21 days ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...