2370 search results - page 250 / 474 » The Characterization of Data-Accumulating Algorithms |
149
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
140
click to vote
ASM
2004
ASM
15 years 9 months ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
138
click to vote
ISTCS
1997
Springer
15 years 8 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
169
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
126
click to vote
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...