Sciweavers

1819 search results - page 9 / 364
» Computability and Representations of the Zero Set
Sort
View
TSP
2008
114views more  TSP 2008»
13 years 7 months ago
Zero-Forcing Precoding and Generalized Inverses
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
Ami Wiesel, Yonina C. Eldar, Shlomo Shamai
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 7 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
ICA
2010
Springer
13 years 8 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
DGCI
1999
Springer
13 years 11 months ago
A Topological Method of Surface Representation
A new method of representing a surface in the 3D space as a single digitally continuous sequence of faces is described. The method is based on topological properties of quasi-manif...
Vladimir Kovalevsky
NIPS
2000
13 years 9 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee