Sciweavers

1314 search results - page 210 / 263
» Approximate data mining in very large relational data
Sort
View
ICDCS
2010
IEEE
15 years 8 months ago
Adam2: Reliable Distribution Estimation in Decentralised Environments
Abstract—To enable decentralised actions in very large distributed systems, it is often important to provide the nodes with global knowledge about the values of attributes across...
Jan Sacha, Jeff Napper, Corina Stratan, Guillaume ...
AAAI
2008
15 years 6 months ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons
ESOP
2011
Springer
14 years 7 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
ICIP
2007
IEEE
16 years 6 months ago
Lossless Image Compression and Selective Encryption using a Discrete Radon Transform
In this paper we propose a new joint encryption and lossless compression technique designed for large images 1 . The proposed technique takes advantage of the Mojette transform pr...
Andrew Kingston, Simone Colosimo, Patrizio Campisi...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 6 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...