The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
Huimin Bian, Andrew C. Ling, Alexander Choong, Jia...
In this paper, we propose a generalized linear model for video packet loss visibility that is applicable to different group-of-picture structures. We develop the model using three...
Ting-Lan Lin, Sandeep Kanumuri, Yuan Zhi, David Po...
This paper investigates the problem of how to improve TCP performance in multi-rate Ad-hoc networks with congested links. To improve network performance, different rate adaptation...
Timo Zauner, Luke Haslett, Wen Hu, Sanjay Jha, Cor...
Abstract— Peer-to-Peer networking has become a major research topic over the last few years. Sharing of structured data in such decentralized environments is a challenging proble...
Verena Kantere, Dimitrios Tsoumakos, Nick Roussopo...