1578 search results - page 157 / 316 » Direct Routing: Algorithms and Complexity |
KDD
1998
ACM
14 years 2 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
This paper presents a fast algorithm for H.264 fractional motion estimation (ME). In H.264 ME is the most time consuming component. The ME process consists of two stages: integer ...
ICDE
2000
IEEE
14 years 11 months ago
2000
IEEE
Push-based data delivery requires knowledge of user interests for making scheduling, bandwidthallocation, and routing decisions. Such information is maintained as user profiles. W...
ICPP
1992
IEEE
14 years 2 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
TC
1998
13 years 9 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...