Sciweavers

3211 search results - page 228 / 643
» On the Grundy Number of a Graph
Sort
View
ICASSP
2010
IEEE
15 years 5 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
RSP
2000
IEEE
156views Control Systems» more  RSP 2000»
15 years 11 months ago
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
Bishnupriya Bhattacharya, Shuvra S. Bhattacharyya
WORDS
2005
IEEE
16 years 3 days ago
A Graph-Based Model for Component-Based Software Development
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based...
Sahra Sedigh-Ali, Arif Ghafoor
COMBINATORICA
2006
125views more  COMBINATORICA 2006»
15 years 6 months ago
Coloring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
Norbert W. Sauer
ECEASST
2010
15 years 3 months ago
Checking Graph-Transformation Systems for Confluence
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
Detlef Plump