903 search results - page 29 / 181 » Non-well-founded trees in categories |
101
click to vote
LREC
2010
15 years 1 months ago
2010
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...
106
click to vote
C3S2E
2010
ACM
15 years 26 days ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
JUCS
2008
14 years 11 months ago
2008
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
98
Voted
ISVC
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of developing an automated visual solution for detecting human activities within industrial environments. This has been performed using an overhead view. Th...
82
Voted
CASES
2010
ACM
14 years 9 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...