Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMBINATORICS
2002
72views more  COMBINATORICS 2002»
10 years 1 months ago
Linearly Independent Products of Rectangularly Complementary Schur Functions
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...
Michael Kleber
DCG
2006
80views more  DCG 2006»
10 years 1 months ago
Lattice Points in Large Borel Sets and Successive Minima
Let B be a Borel set in Ed with volume V (B) = . It is shown that almost all lattices L in Ed contain infinitely many pairwise disjoint d-tuples, that is sets of d linearly indepen...
Iskander Aliev, Peter M. Gruber
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
10 years 5 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
IJCNN
2008
IEEE
10 years 8 months ago
Sparse support vector machines trained in the reduced empirical feature space
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
Kazuki Iwamura, Shigeo Abe
books