3708 search results - page 152 / 742 » Approximating Betweenness Centrality |
123
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
137
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
97
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
107
Voted
ICANNGA
2007
Springer
15 years 4 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
101
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...