Results 241 to 250 of about 1,819,144 (281)
Some of the next articles are maybe not open access.
Locality in Distributed Graph Algorithms
SIAM Journal on Computing, 1992The paper deals with distributed solutions of graph problems. The model assumes that each node of the graph is occupied by a processor that has a unique ID number. Moreover, the computation is reliable, synchronous, and communication is accomplished by message passing along the edges of the graph. Let \(\text{diam}(G)\) denote the diameter of the graph
openaire +2 more sources
Object distribution with local information
Proceedings 21st International Conference on Distributed Computing Systems, 2002We investigate the problem of distributing communicating objects across wide-area environments. Our goals are to balance load, minimize network communication, and use resources efficiently. However, applications running in such environments are often dynamic and highly unpredictable. Furthermore, synchronous communication is usually too expensive to be
Bujor D. Silaghi, Peter J. Keleher
openaire +1 more source
Distributed Locality Sensitivity Hashing
2010 7th IEEE Consumer Communications and Networking Conference, 2010In this paper, we present DLSH Distributed Locality Sensitive Hashing, a similar-data search technology. The huge growth in the size of video content has broken the traditional multi-media index hosting and look-up solutions, these are not able to scale to the size of the current and projected index requirements.
Smita Wadhwa, Pawan Gupta
openaire +1 more source
In vivo distribution and localization of chorein
Biochemical and Biophysical Research Communications, 2007Chorea-acanthocytosis (ChAc) is a hereditary neurodegenerative disorder caused by loss of function mutations in the VPS13A gene encoding chorein. In this study, we produced an antibody against chorein and examined its protein-level expression and localization in mouse.
Yutaka, Kurano +8 more
openaire +2 more sources
Distributed Multi-Robot Localization
2000This paper presents a new approach to the cooperative localization problem, namely distributed multi-robot localization. A group of M robots is viewed as a single system composed of robots that carry, in general, different sensors and have different positioning capabilities.
Stergios I. Roumeliotis, George A. Bekey
openaire +1 more source
On the local aspects of distributional chaos
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2019In this paper, the notion of a distributionally chaotic point (connected with focusing of an uncountable distributionally scrambled set and its envelope around this point) is introduced. The theorems dealing with the existence of such points for selfmaps of the closed unit interval and the possibilities of approximation of nonautonomous discrete ...
Ryszard J. Pawlak, Anna Loranty
openaire +2 more sources
Distribution and Localization of the GABAB Receptor
2016The functional GABAB receptors (GABABRs) are formed by obligate heteromers composed of two principal subunits named GABAB1 and GABAB2. In Drosophila melanogaster three GABAB subunits have been identified: GB1, GB2, and GB3. The GB1 and GB2 subunits need to be coexpressed in Xenopus oocytes or in mammalian cell lines to produce functional GABABRs.
CASTELLI, MARIA PAOLA, Gessa, Gian Luigi
openaire +2 more sources
Local power distribution with nanogrids
2013 International Green Computing Conference Proceedings, 2013Matching electricity demand to supply will be a growing challenge in the future. We argue for the need for further research into local power distribution with a focus on “nanogrids”. We define a nanogrid as a small electricity domain with distinct voltage, price, reliability, quality, and administration. We seek to improve upon existing nanogrids (such
Bruce Nordman, Ken Christensen 0001
openaire +1 more source
Availability and locality in distributed storage
2013 IEEE Global Conference on Signal and Information Processing, 2013Modern distributed file systems are deploying erasure codes to increase storage efficiency compared to block replication. Initially, classical error-correcting codes (like Reed-Solomon) were used but the benefits of custom code designs are now clear.
Ankit Singh Rawat +2 more
openaire +1 more source
On local analysis of distributed optimization
2016 American Control Conference (ACC), 2016We study distributed non-convex optimization on a time-varying multiagent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions. The perturbed push-sum algorithm used for convex distributed optimization in [17] is considered and further studied in [8].
Tatiana Tatarenko, Behrouz Touri
openaire +1 more source