1819 search results - page 85 / 364 » Computability and Representations of the Zero Set |
ACL
2011
14 years 1 months ago
2011
The goal of our research is to improve event extraction by learning to identify secondary role filler contexts in the absence of event keywords. We propose a multilayered event e...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
DALT
2009
Springer
15 years 1 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
SYNASC
2008
IEEE
15 years 4 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
100
click to vote
CVPR
2006
IEEE
15 years 12 months ago
2006
IEEE
Flat appearance-based systems, which combine clever image representations with standard classifiers, might be the most effective way to recognize objects using current technologie...