Sciweavers

2223 search results - page 81 / 445
» Ontological Framework for Approximation
Sort
View
140
Voted
AAAI
2007
15 years 7 months ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter
129
Voted
EACL
2006
ACL Anthology
15 years 6 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
ICASSP
2010
IEEE
15 years 4 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
107
Voted
NPL
2008
63views more  NPL 2008»
15 years 4 months ago
New Routes from Minimal Approximation Error to Principal Components
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
Abhilash Alexander Miranda, Yann-Aël Le Borgn...
162
Voted
TCS
2010
14 years 11 months ago
A fluid analysis framework for a Markovian process algebra
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
Richard A. Hayden, Jeremy T. Bradley