Sciweavers

9849 search results - page 36 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
IPPS
2007
IEEE
15 years 8 months ago
Experience of Optimizing FFT on Intel Architectures
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
Daniel Orozco, Liping Xue, Murat Bolat, Xiaoming L...
97
Voted
IJCNLP
2005
Springer
15 years 7 months ago
Document Clustering with Grouping and Chaining Algorithms
Document clustering has many uses in natural language tools and applications. For instance, summarizing sets of documents that all describe the same event requires first identifyi...
Yllias Chali, Soufiane Noureddine
AAMAS
2011
Springer
14 years 8 months ago
Benchmarking hybrid algorithms for distributed constraint optimisation games
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
Archie C. Chapman, Alex Rogers, Nicholas R. Jennin...
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 8 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 8 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek