Sciweavers

7758 search results - page 76 / 1552
» On the Number of Distributive Lattices
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 5 months ago
On Paraconsistent Weakening of Intuitionistic Negation
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da C...
Zoran Majkic
CVPR
2008
IEEE
14 years 12 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto
LATIN
2010
Springer
14 years 4 months ago
Modelling the LLL Algorithm by Sandpiles
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
Manfred Madritsch, Brigitte Vallée
LATIN
2004
Springer
14 years 3 months ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
AOSD
2009
ACM
13 years 7 months ago
Concept analysis for product line requirements
Traditional methods characterize a software product line's requirements using either functional or quality criteria. This appears to be inadequate to assess modularity, detec...
Nan Niu, Steve M. Easterbrook