Sciweavers

927 search results - page 27 / 186
» Stability of k -Means Clustering
Sort
View
NIPS
2004
13 years 9 months ago
Semi-supervised Learning with Penalized Probabilistic Clustering
While clustering is usually an unsupervised operation, there are circumstances in which we believe (with varying degrees of certainty) that items A and B should be assigned to the...
Zhengdong Lu, Todd K. Leen
CDC
2008
IEEE
14 years 2 months ago
Robust semiglobal stabilization of the second order system by relay feedback with an uncertain variable time delay
We present sufficient conditions for robust relay-delayed semiglobal stabilization of second order systems, which relate the upper bound to an uncertain time delay and the paramete...
Eugenii Shustin, Leonid M. Fridman, Emilia Fridman...
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 8 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
13 years 8 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
JUCS
2002
123views more  JUCS 2002»
13 years 7 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari