1016 search results - page 110 / 204 » Generalized distances between rankings |
CGF
2010
15 years 1 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
128
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
120
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: When analyzing microarray data a primary objective is often to find differentially expressed genes. With empirical Bayes and penalized t-tests the sample variances are...
SIGMETRICS
2006
ACM
15 years 7 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
107
click to vote
ISPD
2003
ACM
15 years 6 months ago
2003
ACM
Floorplanning individual pipelined array modules of a larger overall die can yield beneficial results. Critical paths in every pipeline stage of a pipelined design are roughly equ...