4451 search results - page 179 / 891 » On Random Ordering Constraints |
150
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
132
click to vote
ICA
2007
Springer
15 years 9 months ago
2007
Springer
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
151
click to vote
ICML
1994
IEEE
15 years 8 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
145
click to vote
AAAI
2007
15 years 7 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
143
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...