Sciweavers

3368 search results - page 512 / 674
» GRID Computing
Sort
View
GD
2004
Springer
14 years 3 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
ICEIS
2003
IEEE
14 years 2 months ago
Formalizing Types with Ultimate Closure for Middleware Tools in Information Systems Engineering
: A definition of types in an information system is given from real-world abstractions through data constructs, schema and definitions to physical data values. Category theory su...
B. Nick Rossiter, David A. Nelson, Michael A. Heat...
GCC
2003
Springer
14 years 2 months ago
Temporal Problems in Service-Based Workflows
Time constraint is a key problem in workflow management. Now, with the emergence of new technologies such as web service, grid, this problem has become more complicated in service-...
Zhen Yu, Zhaohui Wu, ShuiGuang Deng, Qi Gao
ICPR
2000
IEEE
14 years 2 months ago
Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
14 years 1 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth