50 search results - page 8 / 10 » Lattices on simplicial partitions |
82
Voted
ICRA
2005
IEEE
15 years 4 months ago
2005
IEEE
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
124
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
COMBINATORICS
1999
14 years 10 months ago
1999
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
GLOBECOM
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
EJC
2006
14 years 11 months ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...