125 search results - page 4 / 25 » ams 2000 |
SPEECH
2002
13 years 10 months ago
2002
An algorithm is proposed which automatically estimates the local signalto-noise ratio (SNR) between speech and noise. The feature extraction stage of the algorithm is motivated by...
MOC
2011
13 years 5 months ago
2011
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
SIAMDM
2000
13 years 10 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
COMBINATORICS
2000
13 years 10 months ago
2000
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
ICALP
2000
Springer
14 years 2 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...