Results 11  20
of
12,325
Noise power spectral density estimation based on optimal smoothing and minimum statistics
 IEEE TRANS. SPEECH AND AUDIO PROCESSING
, 2001
"... We describe a method to estimate the power spectral density of nonstationary noise when a noisy speech signal is given. The method can be combined with any speech enhancement algorithm which requires a noise power spectral density estimate. In contrast to other methods, our approach does not use a ..."
Abstract

Cited by 276 (7 self)
 Add to MetaCart
a voice activity detector. Instead it tracks spectral minima in each frequency band without any distinction between speech activity and speech pause. By minimizing a conditional mean square estimation error criterion in each time step we derive the optimal smoothing parameter for recursive
Global Illumination using Photon Maps
, 1996
"... This paper presents a two pass global illumination method based on the concept of photon maps. It represents a significant improvement of a previously described approach both with respect to speed, accuracy and versatility. In the first pass two photon maps are created by emitting packets of energy ..."
Abstract

Cited by 272 (9 self)
 Add to MetaCart
(photons) from the light sources and storing these as they hit surfaces within the scene. We use one high resolution caustics photon map to render caustics that are visualized directly and one low resolution photon map that is used during the rendering step. The scene is rendered using a distribution ray
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
are preserved under partial isomorphism, by a simple induction. More precisely, one proves, for any assignment A and any partial isomorphism IÎI which is defined on the Avalues for all variables x 1 , ..., x k , that M, A = f iff N , IoA = f . The crucial step in the induction is the quantifier case
Quantitative universality for a class of nonlinear Transformations
 J. Statistical Physics
, 1978
"... A large class of recursion relations xn+l = Af(xn) exhibiting infinite bifurcation is shown to possess a rich quantitative structure essentially independent of the recursion function. The functions considered all have a unique differentiable maximum 2. With f(2) f(x) ~ Ix 21 " (for Ix 21 su ..."
Abstract

Cited by 263 (0 self)
 Add to MetaCart
A large class of recursion relations xn+l = Af(xn) exhibiting infinite bifurcation is shown to possess a rich quantitative structure essentially independent of the recursion function. The functions considered all have a unique differentiable maximum 2. With f(2) f(x) ~ Ix 21 " (for Ix 21
Linear leastsquares algorithms for temporal difference learning
 Machine Learning
, 1996
"... Abstract. We introduce two new temporal difference (TD) algorithms based on the theory of linear leastsquares function approximation. We define an algorithm we call LeastSquares TD (LS TD) for which we prove probabilityone convergence when it is used with a function approximator linear in the adju ..."
Abstract

Cited by 260 (1 self)
 Add to MetaCart
in the adjustable parameters. We then define a recursive version of this algorithm, Recursive LeastSquares TD (RLS TD). Although these new TD algorithms require more computation per timestep than do Sutton's TD(A) algorithms, they are more efficient in a statistical sense because they extract more
Incremental and Decremental Support Vector Machine Learning
, 2000
"... An online recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously seen training data, in a number of steps each computed analytically. The incremental procedure is reversible, and decrement ..."
Abstract

Cited by 251 (4 self)
 Add to MetaCart
An online recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously seen training data, in a number of steps each computed analytically. The incremental procedure is reversible
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
can prove that any nnode bounded degree graph, G, with minimum edge expansion h can be configured offline to simulate any nnode bounded degree graph H in 0(log n/a)steps using constant size queues. By letting H be a universal network, we can then use G to simulate a PRAM online with elay 0(log2 n1
Analysis of Recursive State Machines
 In Proceedings of CAV 2001
, 2001
"... . Recursive state machines (RSMs) enhance the power of ordinary state machines by allowing vertices to correspond either to ordinary states or to potentially recursive invocations of other state machines. RSMs can model the control flow in sequential imperative programs containing recursive proc ..."
Abstract

Cited by 140 (29 self)
 Add to MetaCart
containing an accepting state). We show that both these problems can be solved in time O(n` 2 ) and space O(n`), where n is the size of the recursive machine and ` is the maximum, over all component state machines, of the minimum of the number of entries and the number of exits of each component. We
The degree sequence of a scalefree random graph process
, 2001
"... Recently, Barabási and Albert [2] suggested modeling complex realworld networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional ..."
Abstract

Cited by 243 (2 self)
 Add to MetaCart
for all d ≤ n1/15, where n is the number of vertices, proving as a consequence that γ = 3.
Multiplexed protein quantitation in Saccharomyces cerevisiae using aminereactive isobaric tagging reagents,”
 Molecular and Cellular Proteomics,
, 2004
"... We describe here a multiplexed protein quantitation strategy that provides relative and absolute measurements of proteins in complex mixtures. At the core of this methodology is a multiplexed set of isobaric reagents that yield aminederivatized peptides. The derivatized peptides are indistinguisha ..."
Abstract

Cited by 248 (1 self)
 Add to MetaCart
strategy for reduction of sample complexity (ICAT) is not amenable to identification of posttranslationally modified peptides, as the majority of posttranslational modification (PTM) 1 containing peptides are discarded at the affinity step. We have developed a multiplexed set of reagents for quantitative
Results 11  20
of
12,325