1162 search results - page 115 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
130
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
150
Voted
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
151
Voted
JSA
2007
15 years 3 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
149
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
99
Voted
HPDC
1998
IEEE
15 years 8 months ago
1998
IEEE
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...