Sciweavers

3875 search results - page 731 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
FSTTCS
2000
Springer
15 years 1 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
15 years 1 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
AAAI
2008
15 years 9 hour ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu
73
Voted
AAAI
2007
15 years 9 hour ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
AAAI
2008
15 years 9 hour ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons