714 search results - page 124 / 143 » An efficient algorithm for positive realizations |
APVIS
2008
13 years 10 months ago
2008
Motivated by the growing interest in the use of ridges in scientific visualization, we analyze the two height ridge definitions by Eberly and Lindeberg. We propose a raw feature d...
DAM
2010
13 years 8 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
EOR
2008
13 years 8 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
IJPRAI
2008
13 years 8 months ago
2008
unsupervised construction of topological maps, which provide an abstraction of the environment in terms of visual aspects. An unsupervised clustering algorithm is used to represent...