Sciweavers

604 search results - page 56 / 121
» The Hardness of Metric Labeling
Sort
View
AB
2008
Springer
13 years 10 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
ECIR
2010
Springer
13 years 9 months ago
Evaluation and User Preference Study on Spatial Diversity
Spatial diversity is a relatively new branch of research in the context of spatial information retrieval. Although the assumption that spatially diversified results may meet users&...
Jiayu Tang, Mark Sanderson
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 9 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
AIPS
2006
13 years 9 months ago
Scalable Planning for Distributed Stream Processing Systems
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
Anton Riabov, Zhen Liu
APVIS
2006
13 years 9 months ago
Pattern puzzle: a metaphor for visualizing software complexity measures
Software systems have become increasingly complex over the years. Complexity metrics measures software complexity using real numbers. It is, however, hard to gain insight into dif...
Adam Ghandar, A. S. M. Sajeev, Xiaodi Huang