Sciweavers

925 search results - page 16 / 185
» Connectivity on Complete Lattices
Sort
View
JSCIC
2008
71views more  JSCIC 2008»
14 years 11 months ago
Numerical and Statistical Methods for the Coarse-Graining of Many-Particle Stochastic Systems
In this article we discuss recent work on coarse-graining methods for microscopic stochastic lattice systems. We emphasize the numerical analysis of the schemes, focusing on error ...
Markos A. Katsoulakis, Petr Plechác, Luc Re...
FPL
2001
Springer
77views Hardware» more  FPL 2001»
15 years 4 months ago
Implementation of (Normalised) RLS Lattice on Virtex
We present an implementation of a complete RLS Lattice and Normalised RLS Lattice cores for Virtex. The cores accept 24-bit fixed point inputs and produce 24-bit fixed point predic...
Felix Albu, Jiri Kadlec, Christopher I. Softley, R...
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 12 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
JCT
2011
104views more  JCT 2011»
14 years 6 months ago
Bounds for solid angles of lattices of rank three
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Lenny Fukshansky, Sinai Robins
ICASSP
2011
IEEE
14 years 3 months ago
Two dimensional nested arrays on lattices
In this paper, we develop the theory of a new class of two dimensional arrays with sensors on lattice(s) which can be used to construct a virtual array of much larger size through...
Piya Pal, Palghat P. Vaidyanathan