Sciweavers

727 search results - page 64 / 146
» One line and n points
Sort
View
COMPGEOM
1998
ACM
15 years 2 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
SIAMCOMP
2012
13 years 12 days ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
ICIP
2001
IEEE
15 years 11 months ago
All-integer Hough transform: performance evaluation
The Hough transform is a widely used tool for line detection mainly due to its robustness to noise; on the other hand, it is also known to be computationally expensive, thus often...
Enrico Magli, Gabriella Olmo
NN
2000
Springer
192views Neural Networks» more  NN 2000»
14 years 9 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
AVBPA
1997
Springer
100views Biometrics» more  AVBPA 1997»
15 years 2 months ago
Using Gait as a Biometric, via Phase-weighted Magnitude Spectra
Gait is a biometric which is subject to increasing interest. Current approaches include modelling gait as a spatio-temporal sequence and as an articulated model. By considering leg...
David Cunado, Mark S. Nixon, John N. Carter