Sciweavers

463 search results - page 46 / 93
» The lattice dimension of a graph
Sort
View
100
Voted
EUROCRYPT
2001
Springer
15 years 5 months ago
Key Recovery and Message Attacks on NTRU-Composite
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
Craig Gentry
101
Voted
CLA
2004
15 years 2 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
TIT
2010
136views Education» more  TIT 2010»
14 years 7 months ago
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussia...
Guy Bresler, Abhay Parekh, David N. C. Tse
91
Voted
CVPR
2000
IEEE
16 years 2 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
113
Voted
KBSE
2003
IEEE
15 years 6 months ago
Analysis of Inconsistency in Graph-Based Viewpoints: A Category-Theoretic Approach
Eliciting the requirements for a proposed system typically involves different stakeholders with different expertise, responsibilities, and perspectives. Viewpoints-based approache...
Mehrdad Sabetzadeh, Steve M. Easterbrook