6110 search results - page 312 / 1222 » Approximate Computing |
188
click to vote
UAI
2001
15 years 8 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
559
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
180
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
159
click to vote
CIARP
2009
Springer
16 years 1 months ago
2009
Springer
This paper brings a contribution to the problem of efficiently recognizing handwritten words from a limited size lexicon. For that, a multiple classifier system has been developed...
191
click to vote
VLDB
2004
ACM
16 years 14 hour ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...