Sciweavers

704 search results - page 27 / 141
» Learning the Ideal Evaluation Function
Sort
View
CPAIOR
2009
Springer
15 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
EMMCVPR
2011
Springer
13 years 9 months ago
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
Julian John McAuley, Arnau Ramisa, Tibério ...
KCAP
2009
ACM
15 years 4 months ago
Knowledge integration across multiple texts
One of the grand challenges of AI is to build systems that learn by reading. The ideal system would construct a rich knowledge base capable of automated reasoning. We have built a...
Doo Soon Kim, Ken Barker, Bruce W. Porter
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
15 years 3 months ago
Hardware Acceleration of the Tate Pairing in Characteristic Three
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
Philipp Grabher, Dan Page
95
Voted
ICML
2008
IEEE
15 years 10 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...