1641 search results - page 229 / 329 » Termination Analysis with Algorithmic Learning |
204
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
207
click to vote
POPL
2007
ACM
16 years 23 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
111
click to vote
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...