Biblio

Found 582 results

Filters: First Letter Of Title is N  [Clear All Filters]
2018-05-27
Chun Lam Chan, Pak Hou Che, Sidharth Jaggi, Venkatesh Saligrama.  2011.  Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms. 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park {&} Retreat Center, Monticello, IL, USA, 28-30 September, 2011. :1832–1839.
2014-10-01
Vorobeychik, Yevgeniy, Mayo, Jackson R., Armstrong, Robert C., Ruthruff, Joseph R..  2011.  Noncooperatively Optimized Tolerance: Decentralized Strategic Optimization in Complex Systems. Phys. Rev. Lett.. 107:108702.

We introduce noncooperatively optimized tolerance (NOT), a game theoretic generalization of highly optimized tolerance (HOT), which we illustrate in the forest fire framework. As the number of players increases, NOT retains features of HOT, such as robustness and self-dissimilar landscapes, but also develops features of self-organized criticality. The system retains considerable robustness even as it becomes fractured, due in part to emergent cooperation between players, and at the same time exhibits increasing resilience against changes in the environment, giving rise to intermediate regimes where the system is robust to a particular distribution of adverse events, yet not very fragile to changes.

2018-05-27
Rohit Kumar, David A. Castañón, Erhan Baki Ermis, Venkatesh Saligrama.  2010.  A new algorithm for outlier rejection in particle filters. 13th Conference on Information Fusion, {FUSION} 2010, Edinburgh, UK, July 26-29, 2010. :1–7.
Manqi Zhao, Venkatesh Saligrama.  2010.  Noisy filtered sparse processes: Reconstruction and compression. Proceedings of the 49th {IEEE} Conference on Decision and Control, {CDC} 2010, December 15-17, 2010, Atlanta, Georgia, {USA}. :2930–2935.
2021-02-08
Li, W., Li, L..  2009.  A Novel Approach for Vehicle-logo Location Based on Edge Detection and Morphological Filter. 2009 Second International Symposium on Electronic Commerce and Security. 1:343—345.

Vehicle-logo location is a crucial step in vehicle-logo recognition system. In this paper, a novel approach of the vehicle-logo location based on edge detection and morphological filter is proposed. Firstly, the approximate location of the vehicle-logo region is determined by the prior knowledge about the position of the vehicle-logo; Secondly, the texture measure is defined to recognize the texture of the vehicle-logo background; Then, vertical edge detection is executed for the vehicle-logo background with the horizontal texture and horizontal edge detection is implemented for the vehicle-logo background with the vertical texture; Finally, position of the vehicle-logo is located accurately by mathematical morphology filter. Experimental results show the proposed method is effective.

2018-05-27
Venkatesh Saligrama.  2004.  Necessary and sufficient conditions for robust identification of uncertain LTI systems. Systems {&} Control Letters. 53:117–125.
2017-05-16
Prabhakaran, Manoj, Sahai, Amit.  2004.  New Notions of Security: Achieving Universal Composability Without Trusted Setup. Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing. :242–251.

We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion involves comparing the real protocol execution with an ideal execution involving ideal functionalities (just as in UC-security), but allowing the environment and adversary access to some super-polynomial computational power. We argue the meaningfulness of the new notion, which in particular subsumes many of the traditional notions of security. We generalize the Universal Composition theorem of [3] to the new setting. Then under new computational assumptions, we realize secure multi-party computation (for static adversaries) without a common reference string or any other set-up assumptions, in the new framework. This is known to be impossible under the UC framework.