297 search results - page 52 / 60 » Every Sequence Is Decompressible from a Random One |
STOC
2007
ACM
15 years 11 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...
MOBISYS
2006
ACM
15 years 10 months ago
2006
ACM
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...
141
Voted
PLDI
2004
ACM
15 years 4 months ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
103
Voted
IPL
2010
14 years 5 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
SIAMDM
2010
14 years 5 months ago
2010
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...