Sciweavers

636 search results - page 17 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
ACL
2009
14 years 7 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty
IDEAL
2010
Springer
14 years 7 months ago
Robust 1-Norm Soft Margin Smooth Support Vector Machine
Based on studies and experiments on the loss term of SVMs, we argue that 1-norm measurement is better than 2-norm measurement for outlier resistance. Thus, we modify the previous 2...
Li-Jen Chien, Yuh-Jye Lee, Zhi-Peng Kao, Chih-Chen...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 9 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
AIPS
2004
14 years 11 months ago
Complexity of Planning with Partial Observability
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
Jussi Rintanen
FLAIRS
2008
14 years 12 months ago
On Using SVM and Kolmogorov Complexity for Spam Filtering
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
Sihem Belabbes, Gilles Richard