Sciweavers

30 search results - page 5 / 6
» Anytime Measures for Top-k Algorithms
Sort
View
CCS
2011
ACM
12 years 6 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg
UAI
2008
13 years 7 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
13 years 10 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
AMS
2005
Springer
107views Robotics» more  AMS 2005»
13 years 11 months ago
Elastic View Graphs: A new Framework for Sequential 3D-SLAM
This paper presents a new approach for incremental 3D SLAM from segmented range images with unknown feature association. For feature and motion tracking, an any-time interpretation...
Peter Kohlhepp, Marcus Walther
UAI
2000
13 years 7 months ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier