Sciweavers

51 search results - page 4 / 11
» Estimating class probabilities in random forests
Sort
View
TOMACS
2002
113views more  TOMACS 2002»
13 years 9 months ago
Simulating heavy tailed processes using delayed hazard rate twisting
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
Sandeep Juneja, Perwez Shahabuddin
NIPS
2004
13 years 11 months ago
Conditional Random Fields for Object Recognition
We present a discriminative part-based approach for the recognition of object classes from unsegmented cluttered scenes. Objects are modeled as flexible constellations of parts co...
Ariadna Quattoni, Michael Collins, Trevor Darrell
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 1 days ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
CVPR
2010
IEEE
13 years 10 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...