Sciweavers

413 search results - page 8 / 83
» On space constrained set selection problems
Sort
View
PR
2006
111views more  PR 2006»
13 years 7 months ago
The Bhattacharyya space for feature selection and its application to texture segmentation
A feature selection methodology based on a novel Bhattacharyya space is presented and illustrated with a texture segmentation problem. The Bhattacharyya space is constructed from ...
Constantino Carlos Reyes-Aldasoro, Abhir Bhalerao
ECAI
2010
Springer
13 years 4 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
PAM
2004
Springer
14 years 22 days ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
14 years 20 days ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra
LPNMR
2004
Springer
14 years 22 days ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf