Sciweavers

341 search results - page 31 / 69
» Quantum Computation and Lattice Problems
Sort
View
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
DCC
2009
IEEE
14 years 8 months ago
Communicating the Difference of Correlated Gaussian Sources over a MAC
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
Rajiv Soundararajan, Sriram Vishwanath
ISIM
2007
13 years 9 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 8 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
TEC
2002
101views more  TEC 2002»
13 years 7 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim