Sciweavers

999 search results - page 85 / 200
» Finding shapes in a set of points
Sort
View
TNN
2010
121views Management» more  TNN 2010»
14 years 4 months ago
Foundations of implementing the competitive layer model by Lotka-Volterra recurrent neural networks
The competitive layer model (CLM) can be described by an optimization problem. The problem can be further formulated by an energy function, called the CLM energy function, in the s...
Zhang Yi
PCM
2004
Springer
127views Multimedia» more  PCM 2004»
15 years 3 months ago
Using a Non-prior Training Active Feature Model
This paper presents a feature point tracking algorithm using optical flow under the non-prior training active feature model (NPTAFM) framework. The proposed algorithm mainly focus...
Sangjin Kim, Jinyoung Kang, Jeongho Shin, Seongwon...
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 10 months ago
On the Stretch Factor of Convex Delaunay Graphs
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
Prosenjit Bose, Paz Carmi, Sébastien Collet...
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
14 years 9 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
COMGEO
2000
ACM
14 years 9 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram