Sciweavers

483 search results - page 69 / 97
» Linear Ranking with Reachability
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CSR
2008
Springer
13 years 11 months ago
Additive Preconditioning for Matrix Computations
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys...
ECIR
2006
Springer
13 years 11 months ago
A User-Item Relevance Model for Log-Based Collaborative Filtering
Abstract. Implicit acquisition of user preferences makes log-based collaborative filtering favorable in practice to accomplish recommendations. In this paper, we follow a formal ap...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders
APAL
2010
68views more  APAL 2010»
13 years 10 months ago
Spaces of orders and their Turing degree spectra
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of ...
Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, ...
PC
2002
158views Management» more  PC 2002»
13 years 9 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch