1439 search results - page 8 / 288 » Fast approximation of centrality |
ICMCS
2006
IEEE
14 years 5 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
ICPR
2002
IEEE
14 years 12 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
ISPEC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
JMLR
2010
13 years 5 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
ICDIM
2008
IEEE
14 years 5 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....