Sciweavers

7123 search results - page 288 / 1425
» The Ordered Set of Rough Sets
Sort
View
CODAS
1996
157views more  CODAS 1996»
15 years 8 months ago
Flexible Workflow Framework for Supporting Collaborative Works
Database technologies are indispensable for workflow management system, one of the remarkable groupware supporting asynchronous distributed cooperative work. In this paper, a form...
Takeo Kunishima, Kazumasa Yokota
EJC
2010
15 years 6 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
153
Voted
KI
2008
Springer
15 years 6 months ago
Interactive Dynamic Information Extraction
The IDEX system is a prototype of an interactive dynamic Information Extraction (IE) system. A user of the system expresses an information request for a topic description which is ...
Kathrin Eichler, Holmer Hemsen, Markus Löckel...
155
Voted
CAGD
2005
135views more  CAGD 2005»
15 years 6 months ago
Constrained space curve interpolation with constraint planes
We consider the interpolation of a given set of ordered space data points by a smooth curve in the presence ofa set offinite or infinite constraint planes, where the polyline join...
V. P. Kong, B. H. Ong
ARSCOM
2004
124views more  ARSCOM 2004»
15 years 6 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin