Sciweavers

1951 search results - page 136 / 391
» An algorithm for improving graph partitions
Sort
View
146
Voted
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 6 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
ICCAD
2003
IEEE
143views Hardware» more  ICCAD 2003»
16 years 1 months ago
Fractional Cut: Improved Recursive Bisection Placement
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoid...
Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatk...
ISHPC
2003
Springer
15 years 9 months ago
Code and Data Transformations for Improving Shared Cache Performance on SMT Processors
Simultaneous multithreaded processors use shared on-chip caches, which yield better cost-performance ratios. Sharing a cache between simultaneously executing threads causes excessi...
Dimitrios S. Nikolopoulos
ICTAI
1999
IEEE
15 years 9 months ago
A New Study on Using HTML Structures to Improve Retrieval
Locating useful information effectively from the World Wide Web (WWW) is of wide interest. This paper presents new results on a methodology of using the structures and hyperlinks ...
Michal Cutler, H. Deng, S. Maniccam, Weiyi Meng
NDSS
2008
IEEE
15 years 11 months ago
A Tune-up for Tor: Improving Security and Performance in the Tor Network
The Tor anonymous communication network uses selfreported bandwidth values to select routers for building tunnels. Since tunnels are allocated in proportion to this bandwidth, thi...
Robin Snader, Nikita Borisov