Sciweavers

3220 search results - page 111 / 644
» Constrained Graph Processes
Sort
View
ICS
1989
Tsinghua U.
15 years 2 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
14 years 10 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»
15 years 3 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
14 years 8 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...
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...