Demo Data from EDBT 2026 / reviewers in the wild / expert
Mehmet A. Begen
dblp:61/3832
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2009
0000-0001-7573-0882ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2Graphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 1 · 1 first-author
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.
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › continuous optimization
convex optimization |
0.1 | 1 | 2009 | Appointment scheduling with discrete random durations · SODA 2009 |
Mathematical optimization
discrete optimization |
0.1 | 1 | 2009 | Appointment scheduling with discrete random durations · SODA 2009 |
Mathematical optimization
submodular optimization |
0.1 | 1 | 2009 | Appointment scheduling with discrete random durations · SODA 2009 |
Mathematical optimization
scheduling |
0.0 | 1 | 2009 | Appointment scheduling with discrete random durations · SODA 2009 |
Mathematical optimization › scheduling › machine scheduling
single-machine scheduling |
0.0 | 1 | 2009 | Appointment scheduling with discrete random durations · SODA 2009 |
Methods — techniques the papers use, named apart from their topics
submodularity · 0.1l-convexity · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Appointment scheduling with discrete random durationsabstractWe consider the problem of determining optimal appointment schedule for a given sequence of jobs (e.g., medical procedures) on a single processor (e.g., operating room, examination facility), to minimize the expected total underage and overage costs when each job has a random processing duration given by a joint discrete probability distribution. Simple conditions on the cost rates imply that the objective function is submodular and L-convex. Then there exists an optimal appointment schedule which is integer and can be found in polynomial time. Our model can handle a given due date for the total processing (e.g., end of day for an operating room) after which overtime is incurred and, no-shows and emergencies. Mehmet A. Begen, Maurice Queyranne |
SODA | 1 |
| 2006 | Proxy Selection for Interactive VideoabstractTransmission of time-critical video traffic over the networks with large end-to-end delays poses two main difficulties: slow adaptation to changing network conditions and inability of timely recovery from lost packets. Previously, we proposed a proxy-based solution that enabled us to cope with these problems. Our Internet experiments with a single proxy system showed that the QoS delivered by interactive video applications could be greatly improved by the Intermediate-Proxy approach. In multi-proxy systems, however, the availability of a large number of proxies throughout the Internet will bring the proxy selection problem to the fore. This is an important problem since the benefits of the intermediate-proxy approach can be best exploited with a proper proxy selection. In this study, our goal is to model the dynamics involved in the networks with proxies, and investigate mathematical and practical proxy selection methods. Ali C. Begen, Mehmet A. Begen, Yücel Altunbasak, M. Reha Civanlar |
ICC | 2 |
| 2006 | Predictive Modeling of Video Packet Delay in IP NetworksabstractThis paper studies linear prediction algorithms for packet-delay modeling. A detailed examination of the delay traces collected from video streams encoded at different bitrates, suggests that autoregressive (AR) models can exploit the correlation among the delay samples and produce the best estimates in terms of the mean-squared error criterion. Simulation results show that AR prediction can reduce the average prediction-error power significantly as compared to the exponentially-weighted moving average prediction as well as the recursive weighted median filtering. This is a promising result since many layers in the multimedia communication protocol stack, e.g., rate control, error control and network adaptation, can greatly benefit from accurate packet-delay prediction. Ali C. Begen, Mehmet A. Begen, Yücel Altunbasak |
ICIP | 2 |
| 2003 | Rate-distortion optimized on-demand media streaming with server diversityabstractThis paper studies the streaming of packetized media from multiple servers to a client over a lossy network. In particular, we propose a client-driven rate-distortion optimal packet scheduling algorithm that decides which packet(s) to be requested from which server(s) at a given request opportunity. In doing so, the proposed scheduling algorithm not only attains the maximal presentation quality but also conforms to the rate constraints dictated by the flow, window and congestion control mechanisms. The simulation results clearly demonstrate the efficacy of the proposed algorithm over the single-server rate-distortion optimized streaming. Ali C. Begen, Yücel Altunbasak, Mehmet A. Begen |
ICIP (3) | 3 |
| 2003 | Real-Time Multiple Description and Layered Encoded Video Streaming with Optimal Diverse RoutingabstractMultiple description (MD) and layered coding (LC) are two source-coding approaches proposed for adaptive and robust video streaming over lossy networks. Both streaming methods aim to improve the streaming quality by transmitting the generated multiple sub-bitstreams over partially link-disjoint paths. However, the achieved qualities heavily depend on the media characteristics, path conditions and application requirements. In order to attain the highest quality, we study optimal multi-path selection methods for both MD and LC streaming. The simulations run over an overlay infrastructure show 9.0 - 12.5 dB peak signal-to-noise ratio (PSNR) improvement when the video is streamed over intelligently selected multiple paths instead of the shortest path or maximally link-disjoint paths. By the help of the proposed path selection methods, the end users estimate the expected qualities of MD and LC streaming for the given network conditions and application requirements prior to the streaming, which allows the users to make a choice accordingly. Ali C. Begen, Yücel Altunbasak, Özlem Ergun, Mehmet A. Begen |
ISCC | 4 |