843 search results - page 99 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
134
Voted
KDD
2010
ACM
15 years 4 hour ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
ICANN
2005
Springer
15 years 7 months ago
2005
Springer
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...
122
click to vote
ALGOSENSORS
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of gathering data from a wireless multi-hop network of energy-constrained sensor nodes to a common base station. Specifically, we aim to balance the total...
162
click to vote
JMLR
2012
13 years 4 months ago
2012
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
126
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...