1092 search results - page 185 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
131
click to vote
PAMI
2006
15 years 1 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
111
click to vote
SSS
2010
Springer
15 years 7 days ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
118
click to vote
SEMWEB
2010
Springer
14 years 11 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...
128
Voted
CC
2010
Springer
14 years 11 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
114
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...