Sciweavers

1337 search results - page 76 / 268
» Fast computation of distance estimators
Sort
View
SI3D
1995
ACM
15 years 9 months ago
Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets
We describe an approach for determining potentially visible sets in dynamic architectural models. Our scheme divides the models into cells and portals, computing a conservative es...
David P. Luebke, Chris Georges
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 6 months ago
Outlier detection by sampling with accuracy guarantees
An effective approach to detect anomalous points in a data set is distance-based outlier detection. This paper describes a simple sampling algorithm to efficiently detect distance...
Mingxi Wu, Chris Jermaine
CVPR
2010
IEEE
15 years 6 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
ICDCS
2007
IEEE
16 years 19 days ago
Distributed Density Estimation Using Non-parametric Statistics
Learning the underlying model from distributed data is often useful for many distributed systems. In this paper, we study the problem of learning a non-parametric model from distr...
Yusuo Hu, Hua Chen, Jian-Guang Lou, Jiang Li
CVPR
2001
IEEE
16 years 8 months ago
Adaptive Quasiconformal Kernel Metric for Image Retrieval
This paper presents a new approach to ranking relevant images for retrieval. Distance in the feature space associated with a kernel is used to rank relevant images. An adaptive qu...
Douglas R. Heisterkamp, Jing Peng, H. K. Dai