81 search results - page 15 / 17 » A Fast Adaptive Layout Algorithm for Undirected Graphs |
JACM
2000
13 years 7 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
LCPC
2009
Springer
13 years 12 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
14 years 27 days ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
JCP
2006
13 years 7 months ago
2006
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...