2370 search results - page 394 / 474 » The Characterization of Data-Accumulating Algorithms |
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...