Sciweavers

7123 search results - page 340 / 1425
» The Ordered Set of Rough Sets
Sort
View
RC
2006
88views more  RC 2006»
15 years 6 months ago
Geometric Constructions with Discretized Random Variables
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
Hans-Peter Schröcker, Johannes Wallner
DM
2002
101views more  DM 2002»
15 years 6 months ago
Pseudocomplements of closure operators on posets
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
Francesco Ranzato
MOC
2000
77views more  MOC 2000»
15 years 6 months ago
Ultraconvergence of the patch recovery technique II
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
Zhimin Zhang
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
15 years 6 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür
IJON
2002
74views more  IJON 2002»
15 years 6 months ago
Optimal spontaneous activity in neural network modeling
We consider the origin of the high-dimensional input space as a variable which can be optimized before or during neuronal learning. This set of variables acts as a translation on ...
Daniel Remondini, Nathan Intrator, Gastone C. Cast...