51 search results - page 5 / 11 » How slow is the k-means method |
116
Voted
FMCAD
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
92
Voted
JCP
2008
15 years 23 days ago
2008
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
226
click to vote
OL
2011
14 years 7 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
89
Voted
AUTOMATICA
2008
15 years 27 days ago
2008
This paper presents Lyapunov functions for proving stability of steady gliding motions for vehicles with hydrodynamic or aerodynamic forces and moments. Because of lifting forces ...
118
click to vote
IACR
2011
14 years 13 days ago
2011
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...