2168 search results - page 109 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
174
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
153
click to vote
ICDT
2010
ACM
16 years 1 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
155
click to vote
FC
2005
Springer
15 years 9 months ago
2005
Springer
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
178
click to vote
FPGA
2010
ACM
15 years 4 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
188
click to vote
WINE
2010
Springer
15 years 1 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...