Sciweavers

3238 search results - page 150 / 648
» On the Computational Interpretation of Negation
Sort
View
CVPR
2009
IEEE
16 years 12 months ago
Learning Signs from Subtitles: A Weakly Supervised Approach to Sign Language Recognition
This paper introduces a fully-automated, unsupervised method to recognise sign from subtitles. It does this by using data mining to align correspondences in sections of videos. Bas...
Helen Cooper, Richard Bowden
BIRTHDAY
2009
Springer
16 years 1 months ago
No Syllogisms for the Numerical Syllogistic
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
Ian Pratt-Hartmann
SEMCO
2008
IEEE
16 years 26 days ago
Sentiment Regression: Using Real-Valued Scores to Summarize Overall Document Sentiment
In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews sh...
Adam Drake, Eric K. Ringger, Dan Ventura
RTA
2007
Springer
16 years 18 days ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
ERSHOV
1999
Springer
15 years 10 months ago
On Perfect Supercompilation
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
Jens P. Secher, Morten Heine Sørensen