COMBINATORICS
2002
13 years 10 months ago
2002
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...
DCG
2006
13 years 11 months ago
2006
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...
STOC
1999
ACM
14 years 3 months ago
1999
ACM
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...
IJCNN
2008
IEEE
14 years 5 months ago
2008
IEEE
— 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...