Sciweavers

218 search results - page 43 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
PDCN
2004
13 years 9 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
MANSCI
2008
96views more  MANSCI 2008»
13 years 7 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
TASLP
2010
133views more  TASLP 2010»
13 years 2 months ago
Unsupervised Equalization of Lombard Effect for Speech Recognition in Noisy Adverse Environments
In the presence of environmental noise, speakers tend to adjust their speech production in an effort to preserve intelligible communication. The noise-induced speech adjustments, c...
Hynek Boril, John H. L. Hansen
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
SIAMSC
2010
143views more  SIAMSC 2010»
13 years 6 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos