Sciweavers

4218 search results - page 269 / 844
» Complete sets of cooperations
Sort
View
104
Voted
APLAS
2000
ACM
15 years 5 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
124
Voted
CP
1999
Springer
15 years 5 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
107
Voted
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 4 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
122
Voted
BMVC
2001
15 years 3 months ago
Zernike Velocity Moments for Description and Recognition of Moving Shapes
New Zernike velocity moments have been developed to describe an object, not only by its shape , but also by its motion throughout an image sequence. These are an extended form of ...
Jamie D. Shutler, Mark S. Nixon
92
Voted
AIIDE
2007
15 years 3 months ago
Player Autonomy versus Designer Intent: A Case Study of Interactive Tour Guides
We explore the tradeoff between player autonomy and designer intent by simulating a system of autonomous museum tour guides. Visitors may have different art preferences or may wis...
David L. Roberts, Andrew S. Cantino, Charles Lee I...