Sciweavers

463 search results - page 20 / 93
» The lattice dimension of a graph
Sort
View
EJC
2008
14 years 9 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen
JCT
2007
111views more  JCT 2007»
14 years 9 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
78
Voted
ANTS
1998
Springer
93views Algorithms» more  ANTS 1998»
15 years 1 months ago
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
Igor A. Semaev
66
Voted
CVPR
2010
IEEE
15 years 2 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince
ECCC
2006
97views more  ECCC 2006»
14 years 9 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov