Sciweavers

632 search results - page 86 / 127
» Proving Invariants of Functional Programs
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Soft frame margin estimation of Gaussian Mixture Models for speaker recognition with sparse training data
—Discriminative Training (DT) methods for acoustic modeling, such as MMI, MCE, and SVM, have been proved effective in speaker recognition. In this paper we propose a DT method fo...
Yan Yin, Qi Li
AGTIVE
2007
Springer
15 years 6 months ago
A Single-Step Term-Graph Reduction System for Proof Assistants
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
121
Voted
AAAI
2006
15 years 1 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
99
Voted
AOSD
2007
ACM
15 years 4 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 7 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef