16093 search results - page 196 / 3219 » On the optimality of the neighbor-joining algorithm |
123
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
91
Voted
ICIP
2001
IEEE
16 years 3 months ago
2001
IEEE
Pre-processing algorithms improve the quality of a compression system by removing unimportant data before encoding. This enhances both the visual quality and coding efficiency of ...
ICCD
2004
IEEE
15 years 10 months ago
2004
IEEE
— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nan...
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the hi...
119
click to vote
ICPPW
2002
IEEE
15 years 6 months ago
2002
IEEE
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...