Sciweavers

699 search results - page 60 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
15 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
TIM
2010
144views Education» more  TIM 2010»
14 years 4 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
BROADNETS
2007
IEEE
15 years 4 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
SAC
2004
ACM
15 years 3 months ago
Interval and dynamic time warping-based decision trees
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Juan José Rodríguez, Carlos J. Alons...
CVPR
2004
IEEE
15 years 11 months ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi