Sciweavers

327 search results - page 10 / 66
» On the structure of the Medvedev lattice
Sort
View
APAL
2004
111views more  APAL 2004»
13 years 7 months ago
Concept lattices and order in fuzzy logic
The theory of concept lattices (i.e. hierarchical structures of concepts in the sense of Port-Royal school) is approached from the point of view of fuzzy logic. The notions of par...
Radim Belohlávek
DAM
2002
96views more  DAM 2002»
13 years 7 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
LATIN
2010
Springer
14 years 2 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen