Sciweavers

356 search results - page 37 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
WSC
2004
14 years 11 months ago
Optimal Computing Budget Allocation for Multi-Objective Simulation Models
Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are o...
Loo Hay Lee, Ek Peng Chew, Suyan Teng, David Golds...
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
15 years 9 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
CGF
2010
146views more  CGF 2010»
14 years 9 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
BMVC
2002
15 years 3 days ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum