Sciweavers

654 search results - page 9 / 131
» Ordered Sets and Complete Lattices
Sort
View
MLMTA
2003
13 years 9 months ago
Improved Experimental Results Using Fuzzy Lattice Neurocomputing (FLN) Classifiers
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
Al Cripps, Vassilis G. Kaburlasos, Nghiep Nguyen, ...
JCT
2010
91views more  JCT 2010»
13 years 6 months ago
Lattice path matroids: The excluded minors
A lattice path matroid is a transversal matroid for which some antichain of intervals in some linear order on the ground set is a presentation. We characterize the minor-closed cla...
Joseph E. Bonin
ECCV
2006
Springer
14 years 9 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
JDA
2007
83views more  JDA 2007»
13 years 7 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
DM
2011
238views Education» more  DM 2011»
13 years 2 months ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter