18,545 Hits in 5.8 sec

A recursive frequency-splitting scheme for broadcasting hot videos in VOD service

Yu-Chee Tseng, Ming-Hour Yang, Chi-He Chang
2002 IEEE Transactions on Communications  
One common approach is to partition the video into fixed-length segments, which are broadcast on several channels periodically.  ...  In this paper, we propose a new scheme, called Recursive Frequency Splitting (RFS), that significantly improves on existing schemes in terms of viewer waiting time.  ...  Among all possible choices, we then choose the one that has the minimal waste of bandwidth.  ... 
doi:10.1109/tcomm.2002.801466 fatcat:grwtbr7jibe35hpo3mqk3nbgse

Voronoi-Based Label Placement for Metro Maps

Hsiang-Yun Wu, Shigeo Takahashi, Chun-Cheng Lin, Hsu-Chun Yen
2013 2013 17th International Conference on Information Visualisation  
Our idea is to decompose the entire labeling space intro regions bounded by the metro lines, and then further partition each region into Voronoi cells, each of which is reserved for a station to be annotated  ...  Metro maps with thumbnail photographs serve as common travel guides for providing sufficient information to meet the requirements of travelers in the cities.  ...  ACKNOWLEDGEMENTS This work has been partially supported by JSPS under Grants-in-Aid for Scientific Research (B) No. 24330033 and challenging Ex-  ... 
doi:10.1109/iv.2013.11 dblp:conf/iv/WuTLY13 fatcat:ma6wp55q45gulcuqcrzy3hjvxe

Seamless Channel Transition for the Staircase Video Broadcasting Scheme

Y.-C. Tseng, Y.-C. Chueh, J.-P. Sheu
2004 IEEE/ACM Transactions on Networking  
The SB scheme has been proved to require significantly less buffering space than FB, while sustaining the same startup latency as FB.  ...  Naively allocating a new set of channels for the transition could increase server's load, waste communication bandwidth, and even drain the channels of the system.  ...  We formulate this problem as one of minimizing the average waiting time incurred over all viewers, given a global buffering space constraint for all viewers.  ... 
doi:10.1109/tnet.2004.828965 fatcat:zbqyeh5jzrfgnb5vaernh5jvze

Energy-efficient address translation for virtual memory support in low-power and real-time embedded processors

Xiangrong Zhou, Peter Petrov
2005 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis - CODES+ISSS '05  
The set of virtual pages is partitioned into groups, such that for each group only a few of the least significant bits are used as an index to obtain the physical page number.  ...  The power inefficiency and nondeterministic execution times of address-translation mechanisms have been major barriers in adopting and utilizing the benefits of virtual memory in embedded processors with  ...  Such a partition requires a minimal segment of translation table to map its VPNs.  ... 
doi:10.1145/1084834.1084848 dblp:conf/codes/ZhouP05 fatcat:qxp7sy7jufbtpogoklx5xmcuoe

Automated module assignment in stacked-Vdd designs for high-efficiency power delivery

Yong Zhan, Sachin S. Sapatnekar
2008 ACM Journal on Emerging Technologies in Computing Systems  
In this paper, we present a partition-based algorithm for efficiently assigning modules at the floorplanning level, so as to reuse currents between Vdd domains and minimize the power wasted during the  ...  With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in today's VLSI designs, especially  ...  The objective is to minimize the power wasted in voltage regulators.  ... 
doi:10.1145/1412587.1412591 fatcat:alqyzorwi5c7ja5ym4tmye37ke

3-D Container Packing Heuristics

A. Lim, B. Rodrigues, Y. Yang
2005 Applied intelligence (Boston)  
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems.  ...  They are complementary in their capabilities in dealing with a range of practical problems, and in terms of their computational consumption.  ...  In this case, if we take profit of each item to be its volume then the 3D-KLP corresponds to the minimization of wasted space.  ... 
doi:10.1007/s10489-005-5601-0 fatcat:2gmlwrfgq5d4baunpvjx6awpiu

A fast heuristic for hierarchical Manhattan layout [chapter]

G. Sander
1996 Lecture Notes in Computer Science  
Edges consist of sequences of vertical and horizontal segments. Sharing of segments is allowed in certain situations.  ...  It holds ki < IEil, but in order to avoid wasting of verticM space, we calculate a minimal ki. From the ki the y-coordinates of the nodes and edges can be derived directly. Convention 5a ?  ...  This might be not satisfying because of the waste of space. In this case, the reduction of bend points of edges has minor importance than the usage of space.  ... 
doi:10.1007/bfb0021828 fatcat:dt7qmnsq2nbmnhlwg2qvhs6z5u

Space Frame Optimisation with Spectral Clustering

Xinwei Zhuang, University College London, London, WC1E 6BT UK, Sean Hanna
2020 International Journal of Machine Learning and Computing  
The program has been developed in MATLAB and tested on differently shaped space frame structure under varied loading conditions.  ...  This paper borrows the concept of spectral clustering in the computer vision field, proposes an alternative approach to optimise space frame structure.  ...  but leads to a waste of material.  ... 
doi:10.18178/ijmlc.2020.10.4.965 fatcat:4kt65tueingm7lpzzxxwu2bj4y

Technical Report: Parallel Distance Threshold Query Processing for Spatiotemporal Trajectory Databases on the GPU [article]

Michael G. Gowanlock, Henri Casanova
2014 arXiv   pre-print
Processing moving object trajectories arises in many application domains and has been addressed by practitioners in the spatiotemporal database and Geographical Information System communities.  ...  However, we find that using fixed-size batches is sufficiently efficient in practice.  ...  NNA08DA77A issued through the Office of Space Science.  ... 
arXiv:1405.7461v2 fatcat:myq5a6as4nevrnji7rb4wu62c4

SParTSim: A Space Partitioning Guided by Road Network for Distributed Traffic Simulations

Anthony Ventresque, Quentin Bragard, Elvis S. Liu, Dawid Nowak, Liam Murphy, Georgios Theodoropoulos, Qi Liu
2012 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications  
It outperforms classical uniform space partitioning in terms of road segment cuts and load-balancing.  ...  Hence the need for distributed simulations and for optimal space partitioning algorithms, ensuring an even distribution of the load and minimal communication between computing nodes.  ...  ACKNOWLEDGEMENT This work was supported, in part, by Science Foundation Ireland grant 10/CE/I1855 to Lero -the Irish Software Engineering Research Centre (  ... 
doi:10.1109/ds-rt.2012.37 dblp:conf/dsrt/VentresqueBLNMTL12 fatcat:muosxarouvh7neqalaiyaa56z4

Leveraging unsupervised training sets for multi-scale compartmentalization in renal pathology

Brendon Lutnick, John E. Tomaszewski, Pinaki Sarder, Metin N. Gurcan, John E. Tomaszewski
2017 Medical Imaging 2017: Digital Pathology  
Pixel relationships (modeled as edges) are used to update the energy of the partitioned graph. By iteratively improving the clustering, the optimal number of segments is revealed.  ...  Accurate segmentations of images with as many as 10 6 pixels can be completed only in 5 sec, allowing for attainable multi-scale visualization.  ...  Here minimization of the Hamiltonian  partitions the graph space into connected segments. Unknowns involved are the segment identities i Φ and S .  ... 
doi:10.1117/12.2254750 dblp:conf/midp/LutnickTS17 fatcat:rpxr6qihlnddbjqcxfiakbx5zu

DNA Sequence Segmentation Based on Local Similarity

Martina Visnovská, Tomás Vinar, Brona Brejová
2013 Conference on Theory and Practice of Information Technologies  
Segments found by our algorithm can be used as markers in a wide range of evolutionary studies.  ...  This results in mosaic sequences with various degrees of similarity between regions within a single genome or in genomes of related organisms.  ...  i) given that both space i and space are part of waste regions.  ... 
dblp:conf/itat/VisnovskaVB13 fatcat:cd2yjvfiazg5noljbttnwgpt4m

G-HBase: A High Performance Geographical Database Based on HBase

Hong Van LE, Atsuhiro TAKASU
2018 IEICE transactions on information and systems  
To index geographic data, we first use Geohash as the rowkey in HBase. Then, we present a novel partitioning method, namely binary Geohash rectangle partitioning, to support spatial queries.  ...  We also observed that performance of spatial join in G-HBase is on par with SpatialHadoop and outperforms SJMR algorithm in HBase.  ...  Whereas, single-assignment approach can minimize the data redundancy. However, it leads to wasted overlapped area and more false positives during query processing.  ... 
doi:10.1587/transinf.2017dap0017 fatcat:3gebbjchwfc37ijudsbuuc726a

Segmenting natural images with the least effort as humans

Qiyang Zhao
2015 Procedings of the British Machine Vision Conference 2015  
The human segmentation process would inevitably fulfill the human behavior's principles including the least effort principle (LEP): a human will strive to solve his problem in such a way as to minimize  ...  By profiling we find about 80% updates are wasted as they are overwritten by new updates.  ...  The human segmentation process would inevitably fulfill the human behavior's principles including the least effort principle (LEP): a human will strive to solve his problem in such a way as to minimize  ... 
doi:10.5244/c.29.110 dblp:conf/bmvc/Zhao15 fatcat:idsxyif2ave6djuydqjg33jy5u


Kangnyeon Kim, Tianzheng Wang, Ryan Johnson, Ippokratis Pandis
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Its physical layer supports the concurrency control schemes in a scalable way.  ...  In this paper, we present ERMIA, a memory-optimized database system built from scratch to cater the need of handling heterogeneous workloads.  ...  Because we allow holes in the LSN space, acquiring space in the log is a two-step process.  ... 
doi:10.1145/2882903.2882905 dblp:conf/sigmod/KimWJP16 fatcat:w2jwa4kgfbgendqmeusxwappoi
« Previous Showing results 1 — 15 out of 18,545 results