67 search results - page 11 / 14 » Ranking hubs and authorities using matrix functions |
EICS
2010
ACM
13 years 9 months ago
2010
ACM
We propose an approach that takes as input a task model, which includes the user's view of the interactive system, and automatically discovers a set of categorized and ranked...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
JAL
2002
13 years 7 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
BMCBI
2010
13 years 5 months ago
2010
Background: With the expansion of public repositories such as the Gene Expression Omnibus (GEO), we are rapidly cataloging cellular transcriptional responses to diverse experiment...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...