Sciweavers

425 search results - page 10 / 85
» On linear sets on a projective line
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 2 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
DM
2006
115views more  DM 2006»
13 years 7 months ago
3-Designs from PSL(2, q)
The group PSL(2, q) is 3-homogeneous on the projective line when q is a prime power congruent to 3 modulo 4 and therefore it can be used to construct 3-designs. In this paper, we ...
Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi,...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 7 days ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
CVPR
2007
IEEE
14 years 9 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...