Sciweavers

969 search results - page 35 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
WWW
2010
ACM
14 years 3 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson

Publication
317views
15 years 6 months ago
A Detailed Analysis of How an Urban Trail System Affects the Travel of Cyclists
Transportation specialists, urban planners, and public health officials have been steadfast in encouraging active modes of transportation over the past decades. Conventional thin...
Kevin J. Krizek, Ahmed El-Geneidy, Kristin Thompso...
SDM
2009
SIAM
225views Data Mining» more  SDM 2009»
14 years 5 months ago
Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
Fei Wang, Chris H. Q. Ding, Tao Li
VSTTE
2005
Springer
14 years 2 months ago
From the How to the What
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
Tiziana Margaria, Bernhard Steffen
SIGGRAPH
1992
ACM
14 years 23 days ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder