279 search results - page 43 / 56 » Typability in Partial Applicative Structures |
CGA
2005
13 years 7 months ago
2005
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....