1439 search results - page 83 / 288 » Fast approximation of centrality |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...