Filters








99,275 Hits in 5.5 sec

Broadcasting in Heterogeneous Tree Networks with Uncertainty [chapter]

Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
2011 Lecture Notes in Computer Science  
The broadcasting problem with uncertainty is to find a "minmax-regret" broadcast center to minimize the worst-case loss in the objective function that may occur due to the uncertainty.  ...  In this paper, we propose an O(n log n log log n)-time algorithm for the broadcasting problem with uncertainty in heterogeneous tree networks following the postal model.  ...  The vertex κ is called a broadcast center of G. The broadcasting problem considered the value of each w u,v deterministic.  ... 
doi:10.1007/978-3-642-25591-5_22 fatcat:l7j34d7dsbdtdlxfgfuzx3aqie

Distributed relay selection for virtual MIMO in spectral efficient broadcasting networks

Shih-Jung Lu, Ronald Y. Chang, Wei-Ho Chung
2013 2013 IEEE Wireless Communications and Networking Conference (WCNC)  
In the proposed scheme, each user individually finds the most favorable candidates for VMIMO construction and then all users obtain a joint decision through a voting process.  ...  This paper considers a spectral efficient broadcasting network in which selected mobile devices form a VMIMO system to relay the broadcasted data to help other devices decode the source data more reliably  ...  For the centralized scheme, the computational complexity is given by the number of combinations at the control center since all the computational burden is on the control center.  ... 
doi:10.1109/wcnc.2013.6555160 dblp:conf/wcnc/LuCC13 fatcat:c4q4y42ivfds7mjgiesxz7ol74

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping

Mohsen Ghaffari, Fabian Kuhn, Michael Wagner
2018 International Symposium on Distributed Computing  
This is the first such algorithm with a sublinear round complexity.  ...  We present a distributed minimum spanning tree algorithm with near-optimal round complexity of Õ(D + √ n) and message complexity Õ(min{n 3/2 , m}).  ...  Along the way to this MST algorithm, we find a single-message broadcast algorithm -which can deliver a message from any source to all nodes -with an improved message complexity.  ... 
doi:10.4230/lipics.disc.2018.30 dblp:conf/wdag/GhaffariK18a fatcat:2yt2eaq5dvcmpm675dcshtwdai

Reduced feedback and random beamforming for OFDM MIMO broadcast channels

Maralle Fakhereddin, Masoud Sharif, Babak Hassibi
2009 IEEE Transactions on Communications  
Therefore, we consider neighboring subcarriers as a cluster and find the closed form solution for the joint characteristic function of SINR values at two subcarriers in a cluster.  ...  In addition, through complex and asymptotic analysis, we show that for cluster size of order √ log (for large ), users need only feedback the best SINR at the center subcarrier of each cluster in order  ...  Fig. 1 plots the value of the probability that the edge SINR p ≥ p conditional on the fact that the center SINR q ≥ q for various − distances for a wideband broadcast channel with a 3-antenna transmitter  ... 
doi:10.1109/tcomm.2009.12.060236 fatcat:ql2c7pmzk5a35hva24morj4zc4

COBRA: center-oriented broadcast routing algorithms for wireless ad hoc networks

Intae Kang, R. Poovendran
2004 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)  
From the intuition that the best place to take advantage of the wireless broadcast advantage is at the center of a network deploy region, we concretize this idea into a currently best performing power-efficient  ...  In this paper we provide the initial framework for the study of center-oriented broadcast routing problems using omnidirectional antennas.  ...  Therefore, finding a power-efficient broadcast routing tree for a given topology is almost tantamount to how fully exploited the underlying wireless broadcast advantage or geometric property of the specific  ... 
doi:10.1109/wcnc.2004.1311291 dblp:conf/wcnc/KangP04 fatcat:pszji2uo6rhvxbashs2t5fhodi

Page 7298 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
The objective is to find a collection of & “centers” in a metric space that minimizes the sum of the distances of all points from their nearest center.  ...  Summary: “The problem of finding a spanning forest of a graph in a distributed-processing environment is studied.  ... 

Beyond graphs: Capturing groups in networks

R. Ramanathan, A. Bar-Noy, P. Basu, M. Johnson, W. Ren, A. Swami, Q. Zhao
2011 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)  
We propose the use of the (abstract) simplicial complex to model groups in networks.  ...  We show that a number of problems within social and communications networks such as networkwide broadcast and collaborative teams can be elegantly captured using simplicial complexes in a way that is not  ...  We also thank the anonymous reviewers whose comments helped improve the paper.  ... 
doi:10.1109/infcomw.2011.5928935 fatcat:es6gfp5svbdsdp4as76x4eewim

Page 292 of SMPTE Motion Imaging Journal Vol. 112, Issue 9 [page]

2003 SMPTE Motion Imaging Journal  
The advantage of the value is that it is complete and direct, as no other database is required to find the result.  ...  This is par- ticularly so where the metadata collection is remote from a studio center such as a shoot, but also in a large broadcast organization with many premises that should be designed to work in  ... 

Efficient broadcasting via rateless coding in multihop wireless networks with local information

Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri
2007 Proceedings of the 2007 international conference on Wireless communications and mobile computing - IWCMC '07  
The problem of reliable and energy-efficient one-to-all broadcasting in multihop wireless networks is investigated in this paper and a low-complexity and scalable scheme (referred to as FTS) is proposed  ...  This scheme utilizes rateless coding and the broadcasting nature of wireless channels to reduce the cost of broadcasting.  ...  In this case, reliable and energyefficient broadcasting in a wireless network is equivalent to the problem of finding a minimum-connected dominatingset (MCDS) for the corresponding network graph.  ... 
doi:10.1145/1280940.1280959 dblp:conf/iwcmc/RahnavardVF07 fatcat:vee2mlf6z5ehlemxb7x7se3k2u

Broadcasting in Heterogeneous Tree Networks [chapter]

Yu-Hsuan Su, Ching-Chi Lin, D. T. Lee
2010 Lecture Notes in Computer Science  
The broadcasting problem is to find a broadcast center such that the maximum communication time from the broadcast center to all vertices is minimized.  ...  As a byproduct of the algorithm, we can compute in linear time the broadcasting time of any vertex in the tree, i.e., the maximum time required to transmit messages from the vertex to every other vertex  ...  The broadcasting problem is to find a broadcast center such that the broadcasting time from the broadcast center to all vertices in T is minimized.  ... 
doi:10.1007/978-3-642-14031-0_40 fatcat:jqgwoxqidvfm5d726ggoxpzmme

Trajectory-based ball detection and tracking with applications to semantic analysis of broadcast soccer video

Xinguo Yu, Changsheng Xu, Hon Wai Leong, Qi Tian, Qing Tang, Kong Wah Wan
2003 Proceedings of the eleventh ACM international conference on Multimedia - MULTIMEDIA '03  
To the best of our knowledge, we present the first solution in detecting the basic actions such as touching and passing, and analyzing the team ball possession in broadcast soccer video.  ...  Secondly, a new approach for automatically analyzing broadcast soccer video is proposed, which is based on the ball trajectory.  ...  Consequently, for a given frame we can compute the ball size at the center of the frame if we can find some salient objects in it.  ... 
doi:10.1145/957013.957018 dblp:conf/mm/YuXLTTW03 fatcat:suykcaf35bhshilasmekqmaeqe

Trajectory-based ball detection and tracking with applications to semantic analysis of broadcast soccer video

Xinguo Yu, Changsheng Xu, Hon Wai Leong, Qi Tian, Qing Tang, Kong Wah Wan
2003 Proceedings of the eleventh ACM international conference on Multimedia - MULTIMEDIA '03  
To the best of our knowledge, we present the first solution in detecting the basic actions such as touching and passing, and analyzing the team ball possession in broadcast soccer video.  ...  Secondly, a new approach for automatically analyzing broadcast soccer video is proposed, which is based on the ball trajectory.  ...  Consequently, for a given frame we can compute the ball size at the center of the frame if we can find some salient objects in it.  ... 
doi:10.1145/957016.957018 fatcat:eidigufcancshk65dzrmzkueo4

Making Many People Happy: Greedy Solutions for Content Distribution

Yunsheng Wang, Yuhong Guo, Jie Wu
2011 2011 International Conference on Parallel Processing  
A point that is covered by a circle will be satisfied, and the closer the point is to the center of the circle, the higher the satisfaction.  ...  The base station can only broadcast a limited amount of content, but wishes to satisfy the largest number of users.  ...  Note that the major difference here is that the position of a center can be anywhere in the complex local greedy algorithm.  ... 
doi:10.1109/icpp.2011.31 dblp:conf/icpp/WangGW11 fatcat:p2vr7kyipbahvnchvkmpyguvvu

Page 772 of SMPTE Motion Imaging Journal Vol. 90, Issue 9 [page]

1981 SMPTE Motion Imaging Journal  
There has recently been renewed interest in loudness in the broadcast industry, and this has prompted the development of a new Loudness Indi- cator at the CBS Technology Center.  ...  By ac- cepted definition, a critical band is that maximum bandwidth below which loudness does not diminish as the spectrum of a complex signal is de- creased.  ... 

Delay Reduction by Providing Location Based Services using Hybrid Cache in Peer to Peer Networks

2015 KSII Transactions on Internet and Information Systems  
Now a days, Efficient processing of Broadcast Queries is of critical importance with the ever-increasing deployment and use of mobile technologies.  ...  After analyzing the performance of those two schemes, we propose a hybrid approach (Hybrid Cache), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding  ...  In a mobile environment, a typical BQ is of the form "find the top-three nearest hospitals." The result of the query depends on the location of its requester.  ... 
doi:10.3837/tiis.2015.06.006 fatcat:mskafgkxhnagfkzwvxklkurue4
« Previous Showing results 1 — 15 out of 99,275 results