Sciweavers

471 search results - page 53 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
BIOINFORMATICS
2004
83views more  BIOINFORMATICS 2004»
14 years 9 months ago
Haplotypes histories as pathways of recombinations
Motivation: The diversity of a haplotype, represented as a string of polymorphic sites along a DNA sequence, increases exponentially with the number of sites if recombinations are...
Nadia El-Mabrouk, Damian Labuda
DAM
1999
128views more  DAM 1999»
14 years 9 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ICIP
2006
IEEE
15 years 11 months ago
On the Use of Metrics for Multi-Dimensional Descriptors Clustering
The Visual Thesaurus is a new query approach when no starting image is available. It is a concise representation of all similar regions in a panel of visual patches; the user arra...
Hichem Houissa, Nozha Boujemaa