Sciweavers

1743 search results - page 41 / 349
» Generalized Modal Satisfiability
Sort
View
ACTA
2005
101views more  ACTA 2005»
13 years 9 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
ICMCS
2005
IEEE
114views Multimedia» more  ICMCS 2005»
14 years 3 months ago
A User-Oriented Multimodal-Interface Framework for General Content-Based Multimedia Retrieval
A user-oriented multimodal interface (MMI) framework is proposed. Considering the complexities of media connotations and uncertainties of the user’s demands, content-based retri...
Jinchang Ren, Theodore Vlachos, Vasileios Argyriou
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 4 months ago
Convergence Analysis for Incompressible Generalized Newtonian Fluid Flows with Nonstandard Anisotropic Growth Conditions
We study equations to describe incompressible generalized Newtonian fluids, where the extra stress tensor satisfies a nonstandard anisotropic asymptotic growth condition. An implic...
Erich Carelli, Jonas Haehnle, Andreas Prohl
SIAMNUM
2011
95views more  SIAMNUM 2011»
13 years 4 months ago
A General Convergence Analysis of Some Newton-Type Methods for Nonlinear Inverse Problems
We consider the methods xδ n+1 = xδ n − gαn (F (xδ n)∗F (xδ n))F (xδ n)∗(F (xδ n)− yδ) for solving nonlinear ill-posed inverse problems F (x) = y using the only ava...
Qinian Jin
STACS
2007
Springer
14 years 4 months ago
Bounded-Variable Fragments of Hybrid Logics
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
Thomas Schwentick, Volker Weber