139 search results - page 11 / 28 » Fast perfect sampling from linear extensions |
ENTCS
2006
13 years 8 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
It is well-known that the applicability of Linear Discriminant Analysis (LDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the...
ESANN
2006
13 years 9 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...