Sciweavers

2957 search results - page 335 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Power law discounting for n-gram language models
We present an approximation to the Bayesian hierarchical PitmanYor process language model which maintains the power law distribution over word tokens, while not requiring a comput...
Songfang Huang, Steve Renals
FOCM
2008
100views more  FOCM 2008»
15 years 6 months ago
Meshfree Thinning of 3D Point Clouds
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
Nira Dyn, Armin Iske, Holger Wendland
COMPUTING
2006
130views more  COMPUTING 2006»
15 years 6 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
15 years 6 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon