228 search results - page 21 / 46 » An effective theory of type refinements |
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Joins are among the most frequently executed operations. Several fast join algorithms have been developed and extensively studied; these can be categorized as sort-merge, hash-bas...
CG
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
ENTCS
2008
13 years 8 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
IJCV
2008
13 years 7 months ago
2008
We present an unsupervised approach for learning a generative layered representation of a scene from a video for motion segmentation. The learnt model is a composition of layers, ...