Sciweavers

3708 search results - page 541 / 742
» The Inverse Classification Problem
Sort
View
CVGIP
2002
174views more  CVGIP 2002»
15 years 6 months ago
Computing quadric surface intersections based on an analysis of plane cubic curves
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizin...
Wenping Wang, Barry Joe, Ronald N. Goldman
NN
2000
Springer
161views Neural Networks» more  NN 2000»
15 years 6 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
SIAMCO
2000
117views more  SIAMCO 2000»
15 years 6 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
IEPOL
2002
64views more  IEPOL 2002»
15 years 6 months ago
Is there 'Hope' for price cap regulation?
This article examines the problem of regulatory opportunism or strategic behavior by the regulator that undermines the performance of price cap regulation (PCR) without technicall...
Dennis L. Weisman
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich