Sciweavers

1689 search results - page 53 / 338
» Proximate point searching
Sort
View
PKDD
2010
Springer
141views Data Mining» more  PKDD 2010»
13 years 8 months ago
On Detecting Clustered Anomalies Using SCiForest
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
JCC
2008
88views more  JCC 2008»
13 years 10 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis
PAMI
2006
156views more  PAMI 2006»
13 years 10 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
CGF
2004
138views more  CGF 2004»
13 years 10 months ago
Fast Hybrid Approach for Texturing Point Models
We present three methods for texturing point models from sample textures. The first method, the point parameterization method, uses a fast distortion-bounded parameterization algo...
Haitao Zhang, Feng Qiu, Arie E. Kaufman
MP
1998
73views more  MP 1998»
13 years 10 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott