986 search results - page 166 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
CISS
2011
IEEE
12 years 11 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
MST
2002
13 years 7 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...