Sciweavers

1439 search results - page 157 / 288
» Fast approximation of centrality
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 10 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
435
Voted
EMINDS
2011
244views more  EMINDS 2011»
14 years 7 months ago
A Framework for Designers to Support Prospective Design
In this paper, we analyze the term ”prospective design” from various perspectives. The theoretical-, research- and empirical-based approximations are centralized. Furthermore, ...
Udo Schubert
123
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 1 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
114
Voted
ICCV
2005
IEEE
16 years 2 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon