127 search results - page 17 / 26 » Computational Complexity of Some Problems Involving Congruen... |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
IEEESCC
2008
IEEE
14 years 1 months ago
2008
IEEE
The semantic web services composition process arranges several web services into one composite to realize complex workflows. To do this, semantic metadata of web services’ desc...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...