Sciweavers

2181 search results - page 212 / 437
» The restriction scaffold problem
Sort
View
TNN
2008
122views more  TNN 2008»
15 years 6 months ago
Two-Microphone Separation of Speech Mixtures
Separation of speech mixtures, often referred to as the cocktail party problem, has been studied for decades. In many source separation tasks, the separation method is limited by t...
Michael Syskind Pedersen, DeLiang Wang, Jan Larsen...
JCT
2007
90views more  JCT 2007»
15 years 6 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
JDA
2007
73views more  JDA 2007»
15 years 6 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
CGF
2005
133views more  CGF 2005»
15 years 6 months ago
Constrained Visualization Using the Shepard Interpolation Family
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....
Ken W. Brodlie, Muhammed Rafiq Asim, Keith Unswort...
ACTA
2004
86views more  ACTA 2004»
15 years 6 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy