Sciweavers

96 search results - page 4 / 20
» Linearity, Non-determinism and Solvability
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 2 months ago
The decentralized implementability problem
Abstract-- This paper deals with the problems of decentralized implementability and decentralized regular implementability in the context of finite-dimensional linear differential ...
Shaik Fiaz, Harry L. Trentelman
CVPR
2011
IEEE
13 years 3 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
ORL
1998
97views more  ORL 1998»
13 years 7 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
APPML
2008
66views more  APPML 2008»
13 years 7 months ago
On unbounded operators and applications
Assume that Au = f (1) is a solvable linear equation in a Hilbert space H, A is a linear, closed, densely defined, unbounded operator in H, which is not boundedly invertible, so p...
Alexander G. Ramm