Sciweavers

7886 search results - page 53 / 1578
» An evaluation of bipartitioning techniques
Sort
View
DAC
1997
ACM
14 years 1 months ago
Multilevel Circuit Partitioning
Recent work [2] [5] [11] [12] [14] has illustrated the promise of multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance ...
Charles J. Alpert, Jen-Hsin Huang, Andrew B. Kahng
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
13 years 10 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
CAL
2002
13 years 9 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
USAB
2007
13 years 10 months ago
Improving Interactive Systems Usability Using Formal Description Techniques: Application to HealthCare
In this paper we argue that the formal analysis of an interactive medical system can improve their usability evaluation such that potential erroneous interactions are identified an...
Philippe A. Palanque, Sandra Basnyat, David Navarr...
PE
2008
Springer
114views Optimization» more  PE 2008»
13 years 9 months ago
An efficient technique to analyze the impact of bursty TCP traffic in wide-area networks
In this paper we describe an analytical technique for the performance evaluation of wide-area networks carrying realistic TCP traffic, such as that produced by a large number of f...
Michele Garetto, Donald F. Towsley