94 search results - page 2 / 19 » Markov Random Walk Representations with Continuous Distribut... |
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Partially occluded faces are common in many applications
of face recognition. While algorithms based on sparse
representation have demonstrated promising results, they
achieve t...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
AAAI
2008
13 years 7 months ago
2008
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...