1032 search results - page 126 / 207 » A Category of Explicit Fusions |
TACS
2001
Springer
14 years 11 days ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
UIST
2000
ACM
14 years 9 days ago
2000
ACM
We present a general approach to the dynamic representation of 2D space that is well suited for userinterface layout. We partition space into two distinct categories: full and emp...
CIKM
2000
Springer
14 years 8 days ago
2000
Springer
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...
SIGGRAPH
1999
ACM
14 years 7 days ago
1999
ACM
Artists and illustrators can evoke the complexity of fur or vegetation with relatively few well-placed strokes. We present an algorithm that uses strokes to render 3D computer gra...
SIGGRAPH
1998
ACM
14 years 5 days ago
1998
ACM
In this paper we disprove the belief widespread within the computer graphics community that Catmull-Clark subdivision surfaces cannot be evaluated directly without explicitly subd...