260 search results - page 43 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
100
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
107
click to vote
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
TOG
2002
14 years 9 months ago
2002
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...