Results 1 - 10
of
32
Dependent Random Graphs and Multi-Party Pointer Jumping ˚
"... We initiate a study of a relaxed version of the standard Erdős-Rényi random graph model, where each edge may depend on a few other edges. We call such graphs dependent random graphs. Our main result in this direction is a thorough understanding of the clique number of dependent random graphs. We als ..."
Abstract
- Add to MetaCart
of the canonical NOF communication problems, yet even for three players, its communication complexity is not well understood. Our protocol for mpj3 costs Opnplog lognq { lognq communication, improving on a bound from [9]. We extend our protocol to the non-Boolean pointer jumping problem ympjk, achieving an upper
Load Balancing and Density Dependent Jump Markov Processes (Extended Abstract)
- In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science
, 1996
"... Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following ..."
Abstract
- Add to MetaCart
Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following
Opaque control-flow integrity.
- In 22nd Annual Network and Distributed System Security Symposium, NDSS,
, 2015
"... Abstract-A new binary software randomization and ControlFlow Integrity (CFI) enforcement system is presented, which is the first to efficiently resist code-reuse attacks launched by informed adversaries who possess full knowledge of the inmemory code layout of victim programs. The defense mitigates ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
Abstract-A new binary software randomization and ControlFlow Integrity (CFI) enforcement system is presented, which is the first to efficiently resist code-reuse attacks launched by informed adversaries who possess full knowledge of the inmemory code layout of victim programs. The defense
Steady State Analysis of Balanced-Allocation Routing
, 2005
"... We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the "balanced-allocation" principle [Y. Azer, A. Z. Broder, A. ..."
Abstract
- Add to MetaCart
available bandwidth is found, the BDAR algorithm compares and chooses the best among a small number of alternatives. We show that, at the expense of a minor increase in routing overhead, the BDAR algorithm gives a substantial improvement in network performance, in terms both of network congestion
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
1An Efficient Feedback Coding Scheme with Low Error Probability for Discrete Memoryless Channels
"... Existing feedback communication schemes are either specialized to particular channels (Schalkwijk–Kailath, Horstein), or apply to general channels but have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a feedback coding scheme ..."
Abstract
- Add to MetaCart
scheme that combines features from previous schemes in addition to a new randomization technique. We show that our scheme achieves the capacity for all discrete memoryless channels and establish a bound on its error exponent that approaches the sphere packing bound as the rate approaches the capacity
Active Mask Framework for Segmentation of Fluorescence Microscope Images
"... m]]l]]s¶D]]¿÷mB]iv]b]oD]m¶¨]iv]§]iv]r]j]t¿rv]]irj]]t]]m] / | ap]]r¿]ÎNy]s¶D]]mb¶r]ix} Û]Ix]]rd]mb]} p—N]t]o%ism] in]ty]m] / || Û]Is]¡uÎc]rN]]riv]nd]p]*N]m]st¶ I always bow to Śri ̄ Śāradāmbā, the limitless ocean of the nectar of compassion, who bears a rosary, a vessel of nectar, the symbol of ..."
Abstract
- Add to MetaCart
m]]l]]s¶D]]¿÷mB]iv]b]oD]m¶¨]iv]§]iv]r]j]t¿rv]]irj]]t]]m] / | ap]]r¿]ÎNy]s¶D]]mb¶r]ix} Û]Ix]]rd]mb]} p—N]t]o%ism] in]ty]m] / || Û]Is]¡uÎc]rN]]riv]nd]p]*N]m]st¶ I always bow to Śri ̄ Śāradāmbā, the limitless ocean of the nectar of compassion, who bears a rosary, a vessel of nectar, the symbol of knowledge and a book in Her lotus hands. Dedicated to the Lotus Feet of the revered Sadguru. This thesis presents a new active mask (AM) framework and an algorithm for segmenta-tion of digital images, particularly those of punctate patterns from fluorescence microscopy. Fluorescence microscopy has greatly facilitated the task of understanding complex sys-tems at cellular and molecular levels in recent years. Segmentation, an important yet dif-ficult problem, is often the first processing step following acquisition. Our team previously demonstrated that a stochastic active contour based algorithm together with the concept of
zbw Leibniz-Informationszentrum WirtschaftLeibniz Information Centre for Economics
, 2002
"... Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle ..."
Results 1 - 10
of
32