Sciweavers

3238 search results - page 552 / 648
» On the Computational Interpretation of Negation
Sort
View
SIGIR
2010
ACM
15 years 6 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
APPML
2007
92views more  APPML 2007»
15 years 6 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
15 years 6 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 6 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
CAGD
2010
151views more  CAGD 2010»
15 years 6 months ago
On the complexity of smooth spline surfaces from quad meshes
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
Jörg Peters, Jianhua Fan