Sciweavers

AAAI
2006
13 years 5 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
AAAI
2006
13 years 5 months ago
A Unified Knowledge Based Approach for Sense Disambiguation and Semantic Role Labeling
In this paper, we present a unified knowledge based approach for sense disambiguation and semantic role labeling. Our approach performs both tasks through a single algorithm that ...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
AAAI
2006
13 years 5 months ago
An Efficient Algorithm for Local Distance Metric Learning
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu
AAAI
2006
13 years 5 months ago
Dual Search in Permutation State Spaces
Geometrical symmetries are commonly exploited to improve the efficiency of search algorithms. We introduce a new logical symmetry in permutation state spaces which we call duality...
Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan S...
AAAI
2006
13 years 5 months ago
Interpretation of Design Drawings by Analogy
Patrick W. Yaner, Ashok K. Goel
AAAI
2006
13 years 5 months ago
Improve Web Search Using Image Snippets
The Web has become the largest information repository over the world. Therefore, effectively and efficiently searching the Web becomes a key challenge. Previous research on Web se...
Xiao-Bing Xue, Zhi-Hua Zhou, Zhongfei (Mark) Zhang
AAAI
2006
13 years 5 months ago
Robust Support Vector Machine Training via Convex Outlier Ablation
One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitig...
Linli Xu, Koby Crammer, Dale Schuurmans
AAAI
2006
13 years 5 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
AAAI
2006
13 years 5 months ago
On the Complexity of Linking Deductive and Abstract Argument Systems
Michael Wooldridge, Paul E. Dunne, Simon Parsons
AAAI
2006
13 years 5 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto