491 search results - page 28 / 99 » Ranking Abstractions |
SIAMMAX
2010
13 years 3 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
IR
2010
13 years 7 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
SEMWEB
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...