Sciweavers

2181 search results - page 109 / 437
» The restriction scaffold problem
Sort
View
AUTOMATICA
2008
118views more  AUTOMATICA 2008»
13 years 10 months ago
Optimally switched linear systems
In this paper we address the problem of optimal switching for switched linear systems. The uniqueness of our approach lies in describing the switching action by multiple control i...
Tuhin Das, Ranjan Mukherjee
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 10 months ago
On the Complexity of Elementary Modal Logics
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...
Edith Hemaspaandra, Henning Schnoor
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 10 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
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...
Frank Neven, Thomas Schwentick
IJCV
2007
174views more  IJCV 2007»
13 years 10 months ago
Automatic Panoramic Image Stitching using Invariant Features
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...
Matthew Brown, David G. Lowe
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 9 months ago
Polynomial Time Data Reduction for Dominating Set
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...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier