1041 search results - page 116 / 209 » Randomizing Reductions of Search Problems |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
IR
2007
13 years 7 months ago
2007
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...