Sciweavers

1117 search results - page 21 / 224
» Equivalent Representations of Set Functions
Sort
View
JOLLI
2007
88views more  JOLLI 2007»
14 years 9 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
RSKT
2010
Springer
14 years 7 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
PR
2000
116views more  PR 2000»
14 years 9 months ago
On links between mathematical morphology and rough sets
Based on the observation that rough sets and mathematical morphology are both using dual operators sharing similar properties, we investigate more closely the links existing betwe...
Isabelle Bloch
CDC
2010
IEEE
216views Control Systems» more  CDC 2010»
14 years 4 months ago
On infinity norms as Lyapunov functions: Alternative necessary and sufficient conditions
This paper considers the synthesis of infinity norm Lyapunov functions for discrete-time linear systems. A proper conic partition of the state-space is employed to construct a fini...
Mircea Lazar
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 2 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula