Sciweavers

39 search results - page 2 / 8
» Monotone complexity and the rank of matrices
Sort
View
WWW
2005
ACM
14 years 7 months ago
BackRank: an alternative for PageRank?
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
Mohamed Bouklit, Fabien Mathieu
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
13 years 12 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
FOSSACS
2008
Springer
13 years 8 months ago
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...
Dirk Pattinson, Lutz Schröder
ICML
2007
IEEE
14 years 7 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara