16666 search results - page 254 / 3334 » Descriptive and Computational Complexity |
174
click to vote
BMVC
2010
15 years 4 months ago
2010
The standard approach to multi-modal registration is to apply sophisticated similarity metrics such as mutual information. The disadvantage of these measures, in contrast to simpl...
175
click to vote
ICSOC
2010
Springer
15 years 4 months ago
2010
Springer
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
178
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
321
click to vote
ECCC
2011
15 years 1 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
186
click to vote
TIP
2010
15 years 1 months ago
2010
Particle filters (PFs) are Bayesian filters capable of modeling nonlinear, non-Gaussian, and nonstationary dynamical systems. Recent research in PFs has investigated ways to approp...