Sciweavers

1082 search results - page 131 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CCCG
2008
13 years 10 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz
NIPS
2004
13 years 10 months ago
Learning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
Anton Schwaighofer, Volker Tresp, Kai Yu
ICCV
2003
IEEE
14 years 11 months ago
Two-Frame Wide Baseline Matching
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
Jiangjian Xiao, Mubarak Shah
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 11 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
GIS
2007
ACM
14 years 10 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...