Detecting cars in large aerial photographs can be quite a challenging task, given that cars in such datasets are often barely visible to the naked human eye. Traditional object detection algorithms fail to perform well when it comes to detecting cars under such circumstances. One would rather use context or exploit spatial relationship between different entities in the scene to narrow down the ...

In many types of technical texts, meaning is embedded in noun compounds. A language understanding program needs to be able to interpret these in order to ascertain sentence meaning. We explore the possibility of using the top levels of an existing lexical hierarchy for the purpose of placing words from a noun compound into categories, and then using this category membership to determine the rel...

The branching-time temporal logic EF is a simple, but natural fragment of computation tree logic (CTL) and the modal-calculus. We study the decidability of the model checking problem for EF and innnite-state systems. We use process rewrite systems (PRS) to describe innnite-state systems and deene a hierarchy of subclasses of PRS that includes Petri nets, pushdown processes, Basic Parallel Proce...

This paper presents a model in which resource allocation are calculated in real-time by boundedly rational members of an administrative staa. We consider a class of hierarchical procedures in which information about cost functions ows up and is aggregated by a hierarchy, while allocations ow down and are disag-gregated by the hierarchy. We assume that the cost functions are quadratic and that t...

This paper introduces an objective metric for evaluating a parsing scheme It is based on Shannon s original work with letter sequences which can be extended to part of speech tag sequences It is shown that this regular language is an inadequate model for natural language but a representation is used that models language slightly higher in the Chomsky hierarchy We show how the entropy of parsed ...

Advances in research on quality metrics for bounding volume hierarchies (BVHs) have shown that greedy top-down SAH builders construct BVHs with superior traversal performance despite the fact that the resulting SAH values are higher than those created by more sophisticated builders. Motivated by this observation we examine a construction algorithm that uses recursive SAH values of temporarily c...