Sciweavers

2018 search results - page 73 / 404
» Magnitude-preserving ranking algorithms
Sort
View
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 3 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
ICALP
2010
Springer
15 years 11 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
NA
2008
80views more  NA 2008»
15 years 6 months ago
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
Yuli Eidelman, Luca Gemignani, Israel Gohberg
BMCBI
2010
224views more  BMCBI 2010»
15 years 6 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
CIKM
2008
Springer
15 years 8 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell