Sciweavers

2836 search results - page 272 / 568
» Parsing Algorithms and Metrics
Sort
View
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
15 years 10 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
ISNN
2011
Springer
14 years 7 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
FOCS
2004
IEEE
15 years 8 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
COMPGEOM
2011
ACM
14 years 7 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
15 years 11 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner