67 search results - page 6 / 14 » Constructing Strictly Positive Families |
SMILE
1998
Springer
13 years 11 months ago
1998
Springer
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
OOPSLA
2005
Springer
14 years 16 days ago
2005
Springer
Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two...
CPM
2009
Springer
13 years 4 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
CIE
2010
Springer
13 years 12 months ago
2010
Springer
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
ORDER
2010
13 years 5 months ago
2010
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented ...