Sciweavers

359 search results - page 2 / 72
» On the number of chord diagrams
Sort
View
COMPGEOM
2004
ACM
14 years 27 days ago
Separating point sets in polygonal environments
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...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
JAPLL
2008
101views more  JAPLL 2008»
13 years 7 months ago
Circle graphs and monadic second-order logic
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...
Bruno Courcelle
DCG
2010
101views more  DCG 2010»
13 years 6 months ago
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
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 ...
Joel Hass, Tahl Nowik
ISMIR
2003
Springer
133views Music» more  ISMIR 2003»
14 years 19 days ago
Chord segmentation and recognition using EM-trained hidden markov models
Automatic extraction of content description from commercial audio recordings has a number of important applications, from indexing and retrieval through to novel musicological ana...
Alexander Sheh, Daniel P. W. Ellis
IPPS
2007
IEEE
14 years 1 months ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
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...
Min Cai, Kai Hwang