Sciweavers

499 search results - page 77 / 100
» Why neighbor-joining works
Sort
View
SLIP
2003
ACM
15 years 3 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
VL
1997
IEEE
198views Visual Languages» more  VL 1997»
15 years 2 months ago
Behavior Processors: Layers between End-Users and Java Virtual Machines
Visual programming approaches are limited in their usefulness if they do not include a profile of their users that defines exactly who is attempting to solve what kind of problems...
Alexander Repenning, Andri Ioannidou
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 1 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
PEPM
1994
ACM
15 years 1 months ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...
DLT
2007
14 years 11 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold