Sciweavers

7758 search results - page 37 / 1552
» On the Number of Distributive Lattices
Sort
View
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 10 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
ICC
2009
IEEE
151views Communications» more  ICC 2009»
14 years 3 months ago
Improved Vector Perturbation with Modulo Loss Reduction for Multiuser Downlink Systems
— In this paper, we present an improved precoding technique which reduces a modulo loss in vector perturbation (VP) with low complexity for the downlink of a multiuser multiple-i...
Hyeon-Seung Han, Seokhwan Park, Inkyu Lee
DM
2002
116views more  DM 2002»
13 years 8 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
ENTCS
2006
136views more  ENTCS 2006»
13 years 8 months ago
Priestley Duality for Strong Proximity Lattices
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are...
Mohamed A. El-Zawawy, Achim Jung
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
13 years 8 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner