Sciweavers

113 search results - page 12 / 23
» LTL Can Be More Succinct
Sort
View
CVPR
2005
IEEE
16 years 7 hour ago
A SIFT Descriptor with Global Context
Matching points between multiple images of a scene is a vital component of many computer vision tasks. Point matching involves creating a succinct and discriminative descriptor fo...
Eric N. Mortensen, Hongli Deng, Linda G. Shapiro
BIRTHDAY
2003
Springer
15 years 3 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
ATAL
2006
Springer
15 years 1 months ago
Agent interaction in distributed POMDPs and its implications on complexity
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
Jiaying Shen, Raphen Becker, Victor R. Lesser
ICLP
2011
Springer
14 years 1 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ACL
2006
14 years 11 months ago
Morphology-Syntax Interface for Turkish LFG
This paper investigates the use of sublexical units as a solution to handling the complex morphology with productive derivational processes, in the development of a lexical functi...
Özlem Çetinoglu, Kemal Oflazer