438 search results - page 72 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
TCOM
2010
13 years 5 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
TON
2002
13 years 7 months ago
2002
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...