Sciweavers

4536 search results - page 255 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICPR
2002
IEEE
16 years 3 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
110
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing
—The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network ca...
Loc Bui, R. Srikant, Alexander L. Stolyar
VL
1992
IEEE
135views Visual Languages» more  VL 1992»
15 years 6 months ago
Tidy Animations of Tree Algorithms
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In thi...
John T. Stasko, Carlton Reid Turner
110
Voted
ISCAS
2005
IEEE
132views Hardware» more  ISCAS 2005»
15 years 8 months ago
Parallelism/regularity-driven MIMO detection algorithm design
Efficient VLSI implementation of multiple-input multiple-output (MIMO) detectors plays an important role in the real-life implementation of MIMO communication systems. However, m...
Tong Zhang, Yan Xin, Sizhong Chen
OOPSLA
2005
Springer
15 years 8 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine