Sciweavers

3172 search results - page 404 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
AAAI
2008
15 years 9 months ago
HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
Chad Hogg, Héctor Muñoz-Avila, Ugur ...
CIBB
2008
15 years 8 months ago
Splice Site Prediction Using Artificial Neural Networks
A system for utilizing an artificial neural network to predict splice sites in genes has been studied. The neural network uses a sliding window of nucleotides over a gene and predi...
Øystein Johansen, Tom Ryen, Trygve Eftest&o...
AAAI
2006
15 years 8 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
NIPS
2003
15 years 8 months ago
Log-Linear Models for Label Ranking
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
Ofer Dekel, Christopher D. Manning, Yoram Singer
DAWAK
2010
Springer
15 years 7 months ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito