Sciweavers

9849 search results - page 182 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
JMLR
2010
158views more  JMLR 2010»
14 years 11 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
ICASSP
2011
IEEE
14 years 8 months ago
Learning sparse dictionaries with a popularity-based model
Sparse signal representation based on overcomplete dictionaries has recently been extensively investigated, rendering the state-of-the-art results in signal, image and video proce...
Jianzhou Feng, Li Song, Xiaoming Huo, Xiaokang Yan...
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
14 years 4 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
PPOPP
2009
ACM
16 years 5 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ICML
2003
IEEE
16 years 5 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington