3934 search results - page 158 / 787 » Approximate Schedulability Analysis |
202
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
180
click to vote
NIPS
2008
15 years 7 months ago
2008
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
144
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
189
click to vote
ML
2012
ACM
14 years 2 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
194
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...