Sciweavers

40 search results - page 4 / 8
» Efficient Euclidean projections in linear time
Sort
View
EACL
2006
ACL Anthology
13 years 8 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre
PC
2008
119views Management» more  PC 2008»
13 years 7 months ago
GREMLINS: a large sparse linear solver for grid environment
Traditional large sparse linear solvers are not suited in a grid computing environment as they require a large amount of synchronization and communication penalizing the performan...
Raphaël Couturier, Christophe Denis, Fabienne...
ICALP
2009
Springer
14 years 7 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
NIPS
2004
13 years 8 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
ICCV
2007
IEEE
14 years 9 months ago
Spectral Regression for Efficient Regularized Subspace Learning
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
Deng Cai, Xiaofei He, Jiawei Han