Sciweavers

1357 search results - page 156 / 272
» Clustering Orders
Sort
View
DATE
2005
IEEE
105views Hardware» more  DATE 2005»
14 years 1 months ago
An Improved Multi-Level Framework for Force-Directed Placement
One of the greatest impediments to achieving high quality placements using force-directed methods lies in the large amount of overlap initially present in these techniques. This o...
Kristofer Vorwerk, Andrew A. Kennings
COCOON
2005
Springer
14 years 1 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
AVI
2010
13 years 9 months ago
A new weaving technique for handling overlapping regions
The use of transparencies is a common strategy in visual representations to guarantee the visibility of different overlapping graphical objects, especially, if no visibility-decid...
Martin Luboschik, Axel Radloff, Heidrun Schumann
CSDA
2006
84views more  CSDA 2006»
13 years 8 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans