14235 search results - page 2686 / 2847 » Is computer science science |
111
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
133
click to vote
DAM
2008
15 years 4 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
119
click to vote
DKE
2008
15 years 4 months ago
2008
Keyword searching while very successful in narrowing down the contents of the Web to the pertaining subset of information, has two primary drawbacks. First, the accuracy of the se...
160
click to vote
EJC
2008
15 years 4 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
137
click to vote
EJC
2008
15 years 4 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...