Sciweavers

1055 search results - page 97 / 211
» Enumerations in computable structure theory
Sort
View
SIBGRAPI
1999
IEEE
15 years 10 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
AIMSA
2010
Springer
15 years 8 months ago
Towards Ontological Blending
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
Joana Hois, Oliver Kutz, Till Mossakowski, John A....
SEMCO
2009
IEEE
16 years 1 months ago
Understanding Implicit Entities and Events with Getaruns
- Semantic processing represents the new challenge for all applications that require text understanding, as for instance Q/A. In this paper we will highlight the need to couple sta...
Rodolfo Delmonte
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
CHI
2008
ACM
16 years 6 months ago
Co-located group interaction design
This design theatre experience explores the use of choreographic improvisation exercises to reflect on the structures of interaction in a mobile, co-located group. The design tech...
Cecily Morrison, Alan F. Blackwell