1060 search results - page 62 / 212 » On the Discovery of Random Trees |
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
CDC
2009
IEEE
15 years 2 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...
104
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...
CSDA
2008
14 years 10 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
108
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...