Sciweavers

3702 search results - page 291 / 741
» All Pairings Are in a Group
Sort
View
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 6 months ago
Opportunistic Communications in an Orthogonal Multiaccess Relay Channel
— The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the...
Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Na...
INFSOF
2006
151views more  INFSOF 2006»
15 years 6 months ago
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
171
Voted
DAM
2007
94views more  DAM 2007»
15 years 6 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
139
Voted
ENDM
2007
70views more  ENDM 2007»
15 years 6 months ago
Hamiltonian fault-tolerance of hypercubes
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
Tomás Dvorák, Petr Gregor
110
Voted
JSAC
2006
63views more  JSAC 2006»
15 years 6 months ago
Generalized pairwise complementary codes with set-wise uniform interference-free windows
Abstract--This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire cod...
Hsiao-Hwa Chen, Yu-Ching Yeh, Xi Zhang, Aiping Hua...