Sciweavers

1403 search results - page 78 / 281
» Sampling Techniques for Kernel Methods
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Exploring implicit score normalization techniques in speaker verification
In this paper we first introduce four kinds of modification of Symmetric Scoring [1] which produce likelihood ratios that do not need to be explicitly normalized, i.e. T-norm, Z...
Ce Zhang, Rong Zheng, Bo Xu
TPDS
1998
98views more  TPDS 1998»
14 years 9 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
NLP
2000
15 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
INFORMATICALT
2007
88views more  INFORMATICALT 2007»
14 years 9 months ago
The Extension of the Van Der Pauw Method to Anisotropic Media
Abstract. The method for calculating the specific conductivity tensor of an anisotropically conductive medium, proposed in this paper, distinguishes itself by the simplicity of ph...
Jonas Kleiza, Mifodijus Sapagovas, Vytautas Kleiza
NIPS
2001
14 years 11 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...