569 search results - page 78 / 114 » Online Bounds for Bayesian Algorithms |
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
137
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
104
click to vote
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
In Cognitive Radio scenarios channelization information from primary network may be available to the spectral monitor. Under this assumption we propose a spectral estimation algor...