Sciweavers

1461 search results - page 167 / 293
» Complexity of Graph Covering Problems
Sort
View
ISPA
2007
Springer
14 years 4 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
DAC
2009
ACM
14 years 2 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
VIP
2003
13 years 11 months ago
On the Structural Algorithm of Filtering Graphs for Layout
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
Xiaodi Huang, Wei Lai
IPPS
2009
IEEE
14 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
SIBGRAPI
2008
IEEE
14 years 4 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...