2638 search results - page 2 / 528 » Random Geometric Complexes |
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
CIE
2006
Springer
13 years 10 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
BIOINFORMATICS
2008
13 years 6 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...