Sciweavers

256 search results - page 29 / 52
» Short trees in polygons
Sort
View
JCT
2007
94views more  JCT 2007»
13 years 8 months ago
A bijection between 2-triangulations and pairs of non-crossing Dyck paths
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
Sergi Elizalde
ISMIR
2004
Springer
162views Music» more  ISMIR 2004»
14 years 2 months ago
Features and classifiers for the automatic classification of musical audio signals
Several factors affecting the automatic classification of musical audio signals are examined. Classification is performed on short audio frames and results are reported as “ba...
Kristopher West, Stephen Cox
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
14 years 9 days ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
TON
2002
79views more  TON 2002»
13 years 8 months ago
A multicast routing algorithm for LEO satellite IP networks
Abstract--Satellite networks provide global coverage and support a wide range of services. Since Low Earth Orbit (LEO) satellites provide short round-trip delays, they are becoming...
Eylem Ekici, Ian F. Akyildiz, Michael D. Bender
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 9 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...