16404 search results - page 937 / 3281 » A set coverage problem |
191
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
194
click to vote
CRYPTO
2008
Springer
15 years 9 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
211
click to vote
DAWAK
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
187
click to vote
DIS
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
198
click to vote
ESEM
2008
ACM
15 years 9 months ago
2008
ACM
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...