Sciweavers

2610 search results - page 265 / 522
» Computational Probabilistic Non-interference
Sort
View
AAAI
2011
14 years 4 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
ECCV
2010
Springer
13 years 10 months ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
TOG
2012
193views Communications» more  TOG 2012»
13 years 6 months ago
Continuous character control with low-dimensional embeddings
Interactive, task-guided character controllers must be agile and responsive to user input, while retaining the flexibility to be readily authored and modified by the designer. C...
Sergey Levine, Jack M. Wang, Alexis Haraux, Zoran ...
TSMC
2010
14 years 10 months ago
An Architecture for Adaptive Algorithmic Hybrids
We describe a cognitive architecture for creating more robust intelligent systems by executing hybrids of algorithms based on different computational formalisms. The architecture ...
Nicholas L. Cassimatis, Perrin G. Bignoli, Magdale...
CVPR
2008
IEEE
16 years 6 months ago
Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
Daniel Cremers, Frank R. Schmidt, Frank Barthel