Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

This paper explores the physical-layer security in a small cell network with cooperative cache-enabled small base stations (SBSs… Expand

Is this relevant?

2014

2014

Suppose we concatenate two directed graphs, each isomorphic to a $d$ dimensional butterfly (but not necessarily identical to each… Expand

Is this relevant?

2007

2007

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Abstract.Given a k-uniform hypergraph, the Maximumk -Set Packing problem is to find the maximum disjoint set of edges. We prove… Expand

Is this relevant?

2006

2006

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long… Expand

Is this relevant?

1994

1994

This note addresses the problem of learning DNF expressions using membership queries. We extend the results of Kushilevitz and… Expand

Is this relevant?

1992

1992

Given a graph G = (V, E), we consider the problem of finding a set of D pairwise disjoint cliques in the graph with maximum… Expand

Is this relevant?

1984

1984

A direct-detection photon-limited optical communication channel that uses pulse position modulation (PPM) under a pulsewidth… Expand

Is this relevant?

1982

1982

In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques… Expand

Is this relevant?