Sciweavers

5100 search results - page 212 / 1020
» The Linear Complexity of a Graph
Sort
View
101
Voted
CN
2008
118views more  CN 2008»
15 years 20 days ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
NETWORKS
2006
15 years 15 days ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
78
Voted
ECLIPSE
2004
ACM
15 years 6 months ago
Advanced widgets for Eclipse
Information Visualization Toolkits are often in the form of applications or complex frameworks and do not integrate into existing applications very easily. In this paper we introd...
R. Ian Bull, Casey Best, Margaret-Anne D. Storey
ICPP
1995
IEEE
15 years 4 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
105
Voted
ICASSP
2009
IEEE
15 years 7 months ago
Inpainting with sparse linear combinations of exemplars
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
Brendt Wohlberg