1016 search results - page 200 / 204 » Generalized distances between rankings |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
RECSYS
2010
ACM
13 years 10 months ago
2010
ACM
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. O...
AUTOMATICA
2007
2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
13 years 10 months ago
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
BMCBI
2010
13 years 10 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...