We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
Web search is challenging partly due to the fact that search queries and Web documents use different language styles and vocabularies. This paper provides a quantitative analysis ...
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
Traditional machine learning algorithms assume that data are exact or precise. However, this assumption may not hold in some situations because of data uncertainty arising from mea...
Jiangtao Ren, Sau Dan Lee, Xianlu Chen, Ben Kao, R...
We examine a Markovian model for the price evolution of a stock, in which the probability of local upward or downward movement is arbitrarily dependent on the current price itself...