406 search results - page 28 / 82 » Database-friendly random projections |
JMLR
2010
13 years 2 months ago
2010
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...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
BMCBI
2010
13 years 7 months ago
2010
Background: The knowledge about proteins with specific interaction capacity to the protein partners is very important for the modeling of cell signaling networks. However, the exp...
AI
2005
Springer
14 years 1 months ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
JMLR
2010
13 years 6 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...