Sciweavers

1235 search results - page 102 / 247
» Structured Meanings in Computational Linguistics
Sort
View
ACL
2009
15 years 4 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
CVPR
2012
IEEE
13 years 8 months ago
Finite Element based sequential Bayesian Non-Rigid Structure from Motion
Navier’s equations modelling linear elastic solid deformations are embedded within an Extended Kalman Filter (EKF) to compute a sequential Bayesian estimate for the Non-Rigid St...
Antonio Agudo, Begoña Calvo, J. M. M. Monti...
IJIS
2008
42views more  IJIS 2008»
15 years 6 months ago
An efficient triplet-based algorithm for evidential reasoning
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computati...
Yaxin Bi
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 6 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
POPL
2008
ACM
16 years 6 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson