#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1983

2018

- This year (1)
- Last 5 years (26)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Samir Khuller, Anna Moss, Joseph Naor
- Inf. Process. Lett.
- 1999

The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost… (More)

- Joseph Naor, Moni Naor
- SIAM J. Comput.
- 1993

- Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

We consider the Unconstrained Submodular Maximization problem in which we are given a non-negative submodular function f : 2N → ℝ+, and the objective is to find a subset S ⊆ N maximizing f(S). This… (More)

- Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
- J. ACM
- 2001

We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum… (More)

- Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
- SODA
- 1998

We study the problem of scheduling activities of several types under the constraint that at most a fixed number of activities can be scheduled in any single time-slot. Any given activity type is… (More)

We consider the problem of scheduling jobs that are given as <i>groups</i> of non-intersecting segments on the real line. Each job <i>J<inf>j</inf></i> is associated with an interval,… (More)

- Yossi Azar, Joseph Naor, Raphael Rom
- SODA
- 1992

Consider the on-line problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a subset of the servers. Customers arrive… (More)

- Niv Buchbinder, Kamal Jain, Joseph Naor
- ESA
- 2007

We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-dual approach,… (More)

- Dorit S. Hochbaum, Joseph Naor
- IPCO
- 1992

The authors present an O(inn log m) algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier-Motzkin elimination method.… (More)

- Shmuel Peleg, Joseph Naor, Ralph Hartley, David Avnir
- IEEE Transactions on Pattern Analysis and Machine…
- 1984

Textures are classified based on the change in their properties with changing resolution. The area of the gray level surface is measured at serveral resolutions. This area decreases at coarser… (More)