2766 search results - page 243 / 554 » Algorithms for trigonometric polynomials |
147
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
155
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
196
click to vote
COCO
2009
Springer
16 years 23 hour ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
153
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
143
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...