Sciweavers

451 search results - page 3 / 91
» Relationless Completeness and Separations
Sort
View
CPC
2010
116views more  CPC 2010»
13 years 3 months ago
A Separator Theorem for String Graphs and its Applications
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
Jacob Fox, János Pach
TSMC
1998
93views more  TSMC 1998»
13 years 6 months ago
Toward a completely automatic neural-network-based human chromosome analysis
Abstract—The application of neural networks (NN’s) to automatic analysis of chromosome images is investigated in this paper. All aspects of the analysis, namely segmentation, f...
Boaz Lerner
COMPGEOM
2006
ACM
14 years 12 days ago
Complete subdivision algorithms, I: intersection of Bezier curves
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
Chee-Keng Yap
ICASSP
2011
IEEE
12 years 10 months ago
A complete ensemble empirical mode decomposition with adaptive noise
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...
María Eugenia Torres, Marcelo A. Colominas,...
ICASSP
2011
IEEE
12 years 10 months ago
Reconstructing completely overlapped notes from musical mixtures
In mixtures of musical sounds, the problem of overlapped harmonics poses a significant challenge to source separation. Common Amplitude Modulation (CAM) is one of the most effect...
Jinyu Han, Bryan Pardo