359 search results - page 2 / 72 » On the number of chord diagrams |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
JAPLL
2008
14 years 11 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
110
click to vote
DCG
2010
14 years 10 months ago
2010
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
ISMIR
2003
Springer
15 years 4 months ago
2003
Springer
Automatic extraction of content description from commercial audio recordings has a number of important applications, from indexing and retrieval through to novel musicological ana...
67
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...