Sciweavers

16516 search results - page 162 / 3304
» A New Approach for FCSRs
Sort
View
AAAI
2011
14 years 6 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
AAAI
2012
13 years 8 months ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani
PAA
2008
15 years 6 months ago
A sparse Bayesian approach for joint feature selection and classifier learning
Abstract In this paper we present a new method for Joint Feature Selection and Classifier Learning (JFSCL) using a sparse Bayesian approach. These tasks are performed by optimizing...
Àgata Lapedriza, Santi Seguí, David ...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 10 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
NAACL
2004
15 years 7 months ago
A Language Modeling Approach to Predicting Reading Difficulty
We demonstrate a new research approach to the problem of predicting the reading difficulty of a text passage, by recasting readability in terms of statistical language modeling. W...
Kevyn Collins-Thompson, James P. Callan