Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bilal Mahmood

dblp:147/2736 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 87% Datacenter networks · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
buffer management
0.212014
Rethinking buffer management in data center networks · SIGCOMM 2014
Internet architecture and protocols › buffer management
buffer sizing
0.212014
Rethinking buffer management in data center networks · SIGCOMM 2014
Datacenter networks
datacenter transport
0.112014
Rethinking buffer management in data center networks · SIGCOMM 2014
YearPublicationVenuePosition
2014 Rethinking buffer management in data center networks
abstract
Data center operators face extreme challenges in simultaneously providing low latency for short flows, high throughput for long flows, and high burst tolerance. We propose a buffer management strategy that addresses these challenges by isolating short and long flows into separate buffers, sizing these buffers based on flow requirements, and scheduling packets to meet different flow-level objectives. Our design provides new opportunities for performance improvements that complement transport layer optimisations.
Aisha Mushtaq, Asad Khalid Ismail, Abdul Wasay, Bilal Mahmood, Ihsan Ayyub Qazi, Zartash Afzal Uzmi
SIGCOMM4
2014 NRSfM using local rigidity
abstract
In this paper we show that typical nonrigid structure can often be approximated well as locally rigid sub-structures in time and space. Specifically, we assume that: 1) the structure can be approximated as rigid in a short local time window and 2) some point- pairs stay relatively rigid in space, maintaining a fixed distance between them during the sequence. First, we use the triangulation constraints in rigid SfM over a sliding time window to get an initial estimate of the nonrigid 3D structure. Then we automatically identify relatively rigid point-pairs in this structure, and use their length-constancy simultaneously with triangulation constraints to refine the structure estimate. Local factorization inherently handles small camera motion, short sequences and significant natural occlusions gracefully, performing better than nonrigid factorization methods. We show more stable and accurate results as compared to the state-of-the art on even short sequences starting from 15 frames only, containing camera rotations as small as 2° and up to 50% contiguous missing data.
Ali Rehan, Aamer Zaheer, Ijaz Akhter, Arfah Saeed, Muhammad Haris Usmani, Bilal Mahmood, Sohaib Khan
WACV6