Sciweavers

1722 search results - page 117 / 345
» On the sample mean of graphs
Sort
View
ICNS
2009
IEEE
16 years 1 months ago
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
Cédric Gaël Aboue-Nze, Fréd&eac...
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
16 years 24 days ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
ACIVS
2006
Springer
16 years 9 days ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...
TPCG
2003
IEEE
15 years 11 months ago
Guided Navigation in Task-Oriented 3D Graph Visualizations
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
Guido Reina, Sven Lange-Last, Klaus D. Engel, Thom...
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha