1242 search results - page 138 / 249 » The Theory of Grammar Constraints |
109
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
116
Voted
IAT
2010
IEEE
14 years 10 months ago
2010
IEEE
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
113
click to vote
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we present a general framework for analysis of plenoptic sampling by investigating the spectral analysis of plenoptic imaging. The proposed framework provides a uni...
111
Voted
ACL
2012
13 years 3 months ago
2012
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
174
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...