Sciweavers

432 search results - page 27 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
AAAI
1996
13 years 10 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
ECCV
2008
Springer
14 years 10 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
VMV
2001
92views Visualization» more  VMV 2001»
13 years 10 months ago
Using Quaternions for Parametrizing 3-D Rotations in Unconstrained Nonlinear Optimization
In this paper we address the problem of using quaternions in unconstrained nonlinear optimization of 3-D rotations. Quaternions representing rotations have four elements but only ...
Jochen Schmidt, Heinrich Niemann
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
14 years 1 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...