Sciweavers

5606 search results - page 501 / 1122
» Randomization Techniques for Graphs.
Sort
View
JEC
2006
61views more  JEC 2006»
15 years 6 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
NETWORKS
2008
15 years 6 months ago
Grooming for two-period optical networks
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
GD
2009
Springer
15 years 4 months ago
On Open Problems in Biological Network Visualization
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
ICIP
2009
IEEE
16 years 8 months ago
Modified Grabcut For Unsupervised Object Segmentation
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
SAC
2009
ACM
16 years 1 months ago
Visualization of information flows in a very large social network
In this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. To this end, we d...
Shin Gyu Kim, Hyuck Han, Kyungho Jeon, Hyungsoo Ju...