Sciweavers

2610 search results - page 199 / 522
» Computational Probabilistic Non-interference
Sort
View
CVIU
2011
14 years 7 months ago
Single and sparse view 3D reconstruction by learning shape priors
In this paper, we aim to reconstruct free-form 3D models from only one or few silhouettes by learning the prior knowledge of a specific class of objects. Instead of heuristically...
Yu Chen, Roberto Cipolla
CVPR
2004
IEEE
16 years 5 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
CVPR
2008
IEEE
16 years 5 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...
ICPR
2006
IEEE
16 years 5 months ago
On Authorship Attribution via Markov Chains and Sequence Kernels
We investigate the use of recently proposed character and word sequence kernels for the task of authorship attribution and compare their performance with two probabilistic approac...
Conrad Sanderson, Simon Günter
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 4 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...