Sciweavers

256 search results - page 37 / 52
» Recursive Lattice Reduction
Sort
View
LFCS
2007
Springer
14 years 1 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
OTM
2005
Springer
14 years 1 months ago
A Meta-ontological Architecture for Foundational Ontologies
Abstract. In this paper we present and discuss a meta-ontological archifor ontologies which centers on abstract core ontologies (ACOs). s the most abstract part of a foundational o...
Heinrich Herre, Frank Loebe
EUROCRYPT
2003
Springer
14 years 23 days ago
On the Security of RDSA
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
Pierre-Alain Fouque, Guillaume Poupard
CLA
2004
13 years 9 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel
GLOBECOM
2008
IEEE
13 years 7 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu