3934 search results - page 207 / 787 » Approximate Schedulability Analysis |
185
click to vote
ACCV
2006
Springer
15 years 10 months ago
2006
Springer
Shading analysis of an object under near lighting is not an easy task, because the direction and distance of the light source vary over the surface of the object. Observing a small...
181
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
144
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
195
click to vote
PE
2010
Springer
15 years 4 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
169
click to vote
JMLR
2010
15 years 1 months ago
2010
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...