Institution
Center for Discrete Mathematics and Theoretical Computer Science
Facility•Piscataway, New Jersey, United States•
About: Center for Discrete Mathematics and Theoretical Computer Science is a facility organization based out in Piscataway, New Jersey, United States. It is known for research contribution in the topics: Local search (optimization) & Optimization problem. The organization has 140 authors who have published 175 publications receiving 2345 citations.
Topics: Local search (optimization), Optimization problem, Very-large-scale integration, Auxiliary function, Nonlinear programming
Papers published on a yearly basis
Papers
More filters
••
28 Oct 2007TL;DR: This work studies private inference control for aggregate queries, such as those provided by statistical databases or modern database languages, to a database in a way that satisfies privacy requirements and inference control requirements.
Abstract: We study private inference control for aggregate queries, such as those provided by statistical databases or modern database languages, to a database in a way that satisfies privacy requirements and inference control requirements. For each query, the client learns the value of the function for that query if and only if the query passes a specified in- ference control rule. The server learns nothing about the queries, and the client learns nothing other than the query output for passing queries. We present general protocols for aggregate queries with private inference control.
14 citations
••
30 Aug 1999
TL;DR: A combinatorial framework for the study of a natural class of distributed optimization problems that involve decision-making by a collection of n distributed agents in the presence of incomplete information, and shows that optimal non-oblivious algorithms must be non-uniform.
Abstract: We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decision-making by a collection of n distributed agents in the presence of incomplete information; such problems were originally considered in a load balancing setting by Papadimitriou and Yannakakis (Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pp. 61-64, August 1991). For any given decision protocol and assuming no communication among the agents, our framework allows to obtain a combinatorial inclusion-exclusion expression for the probability that no "overflow" occurs, called the winning probability, in terms of the volume of some simple combinatorial polytope.
Within our general framework, we offer a complete resolution to the special cases of oblivious algorithms, for which agents do not "look at" their inputs, and non-oblivious algorithms, for which they do, of the general optimization problem. In either case, we derive optimality conditions in the form of combinatorial polynomial equations. For oblivious algorithms, we explicitly solve these equations to show that the optimal algorithm is simple and uniform, in the sense that agents need not "know" n. Most interestingly, we show that optimal non-oblivious algorithms must be non-uniform: we demonstrate that the optimality conditions admit different solutions for particular, different "small" values of n; however, these solutions improve in terms of the winning probability over the optimal, oblivious algorithm. Our results demonstrate an interesting trade-off between the amount of knowledge used by agents and uniformity for optimal, distributed decision-making with no communication.
14 citations
••
TL;DR: This paper considers the nonlinearly constrained nonlinear integer programming problem over a bounded box and designs an algorithm based on minimizing the auxiliary function with increasing values of the parameter.
13 citations
••
TL;DR: A stoichiometric model for CH4 generation by indigenous microbes is developed that improved on previous first-approximation models by considering long-term biodegradation kinetics for 18 relevant hydrocarbons from three different oil sands operations, lag times, nutrient limitations, and microbial growth and death rates.
13 citations
••
TL;DR: The proposed two frequency domain estimators are maximum a posterior (MAP) and minimum mean square error (MMSE) estimators, respectively, which significantly generalize two single channel optimal frequencydomain estimators of magnitude-squared spectrum.
12 citations
Authors
Showing all 148 results
Name | H-index | Papers | Citations |
---|---|---|---|
Aravind Srinivasan | 60 | 266 | 13711 |
Ding-Zhu Du | 52 | 421 | 13489 |
Elena N. Naumova | 47 | 232 | 8593 |
Rebecca N. Wright | 37 | 113 | 4722 |
Boris Mirkin | 35 | 178 | 6722 |
Mona Singh | 32 | 91 | 5451 |
Fred S. Roberts | 32 | 181 | 5286 |
Tanya Y. Berger-Wolf | 31 | 135 | 3624 |
Rephael Wenger | 26 | 67 | 1900 |
Marios Mavronicolas | 26 | 151 | 2880 |
Seoung Bum Kim | 26 | 165 | 2260 |
M. Montaz Ali | 26 | 101 | 3093 |
Lazaros K. Gallos | 24 | 69 | 4770 |
Myong K. Jeong | 24 | 95 | 1955 |
Nina H. Fefferman | 23 | 107 | 2362 |