2150 search results - page 98 / 430 » On a restricted cross-intersection problem |
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
137
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
134
Voted
IJCV
2007
15 years 4 months ago
2007
This paper concerns the problem of fully automated panoramic image stitching. Though the 1D problem (single axis of rotation) is well studied, 2D or multi-row stitching is more di...
153
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
139
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...