1201 search results - page 154 / 241 » Linear Probing and Graphs |
141
click to vote
ISPAN
2002
IEEE
15 years 5 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
114
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
81
Voted
ICCD
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
86
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
ICNP
2007
IEEE
15 years 7 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...