Sciweavers

2612 search results - page 77 / 523
» Assemblies as Graph Processes
Sort
View
IS
2007
13 years 7 months ago
Improving process models by discovering decision points
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
Sharmila Subramaniam, Vana Kalogeraki, Dimitrios G...
ICS
1989
Tsinghua U.
13 years 11 months ago
Control flow optimization for supercomputer scalar processing
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
Pohua P. Chang, Wen-mei W. Hwu
IS
2008
13 years 7 months ago
Clustering spatial networks for aggregate query processing: A hypergraph approach
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
Engin Demir, Cevdet Aykanat, Berkant Barla Cambazo...
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
14 years 1 months ago
Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
Colin Cooper, Ralf Klasing, Michele Zito
ICIP
2010
IEEE
13 years 5 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...