Sciweavers

3007 search results - page 591 / 602
» Linear Functional Fixed-points
Sort
View
IJON
1998
172views more  IJON 1998»
13 years 6 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
JCB
2002
70views more  JCB 2002»
13 years 6 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
DAM
1999
100views more  DAM 1999»
13 years 6 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
ORL
1998
68views more  ORL 1998»
13 years 6 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
TIT
1998
112views more  TIT 1998»
13 years 6 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec