Sciweavers

1016 search results - page 40 / 204
» Generalized distances between rankings
Sort
View
104
Voted
SI3D
1999
ACM
15 years 5 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
WWW
2010
ACM
15 years 27 days ago
Classification-enhanced ranking
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
Paul N. Bennett, Krysta Marie Svore, Susan T. Duma...
90
Voted
BMCBI
2010
112views more  BMCBI 2010»
15 years 25 days ago
In silico fragmentation for computer assisted identification of metabolite mass spectra
Background: Mass spectrometry has become the analytical method of choice in metabolomics research. The identification of unknown compounds is the main bottleneck. In addition to t...
Sebastian Wolf, Stephan Schmidt, Matthias Mül...
WWW
2004
ACM
16 years 1 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
WWW
2010
ACM
15 years 7 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...