2745 search results - page 276 / 549 » A fast algorithm for computing large Fibonacci numbers |
138
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Grid jobs often consist of a large number of tasks. If the performance of a statically scheduled grid job is unsatisfactory, one must decide which code of which task should be imp...
181
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
127
click to vote
LPAR
1994
Springer
15 years 9 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
137
click to vote
AAAI
2006
15 years 6 months ago
2006
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
155
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...