Sciweavers

48 search results - page 3 / 10
» Lattices of Relatively Axiomatizable Classes
Sort
View
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 7 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis
ICASSP
2011
IEEE
12 years 11 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
ACS
2007
13 years 8 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
PASTE
1998
ACM
14 years 4 days ago
Concept Analysis - A New Framework for Program Understanding
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
Gregor Snelting
CISM
1993
149views GIS» more  CISM 1993»
14 years 19 hour ago
The Weak Instance Model
The weak instance model is a framework to consider the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and upd...
Paolo Atzeni, Riccardo Torlone