Sciweavers

447 search results - page 25 / 90
» Decision trees with minimal costs
Sort
View
COLING
2002
13 years 8 months ago
Learning Verb Argument Structure from Minimally Annotated Corpora
In this paper we investigate the task of automatically identifying the correct argument structure for a set of verbs. The argument structure of a verb allows us to predict the rel...
Anoop Sarkar, Woottiporn Tripasai
CCS
2007
ACM
14 years 3 months ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...
JUCS
2008
130views more  JUCS 2008»
13 years 8 months ago
Experimenting the Automated Selection of COTS Components Based on Cost and System Requirements
: In a component-based development process the selection of components is an activity that takes place over multiple lifecycle phases that span from requirement specifications thro...
Vittorio Cortellessa, Ivica Crnkovic, Fabrizio Mar...
ALDT
2011
Springer
200views Algorithms» more  ALDT 2011»
12 years 8 months ago
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
Tyler Lu, Craig Boutilier
JAIR
2008
120views more  JAIR 2008»
13 years 8 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch