Sciweavers

97 search results - page 3 / 20
» Random Sampling from Pseudo-Ranked B Trees
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Randomized trees for human pose detection
This paper addresses human pose recognition from video sequences by formulating it as a classification problem. Unlike much previous work we do not make any assumptions on the ava...
Grégory Rogez, Jonathan Rihan, Srikumar Ram...
UAI
2004
13 years 9 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 8 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 3 days ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...