1554 search results - page 254 / 311 » Parameterized Complexity and Approximation Algorithms |
PVLDB
2010
14 years 10 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
120
click to vote
TCOM
2010
14 years 10 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
118
click to vote
WALCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
129
click to vote
AAAI
2011
13 years 12 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...