Sciweavers

329 search results - page 51 / 66
» An algorithm for recognition of n-collapsing words
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 4 days ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
PR
2011
14 years 2 months ago
A survey of multilinear subspace learning for tensor data
Increasingly large amount of multidimensional data are being generated on a daily basis in many applications. This leads to a strong demand for learning algorithms to extract usef...
Haiping Lu, Konstantinos N. Plataniotis, Anastasio...
CVPR
2009
IEEE
15 years 4 months ago
ImageNet: A large-scale hierarchical image database
The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images a...
Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai...
FOSSACS
2011
Springer
14 years 3 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
NAACL
2003
15 years 1 months ago
An Analysis of Clarification Dialogue for Question Answering
We examine clarification dialogue, a mechanism for refining user questions with follow-up questions, in the context of open domain Question Answering systems. We develop an algori...
Marco De Boni, Suresh Manandhar