Sciweavers

5580 search results - page 311 / 1116
» Randomized priority algorithms
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Image inpainting-based edge enhancement using the eikonal equation
This paper proposes a novel application of image inpainting techniques for the edge enhancement problems in image deblurring and denoising. The edge enhancement effect is achieved...
Zhaozhong Wang
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
14 years 10 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
CVPR
2009
IEEE
17 years 1 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
IDEAS
2002
IEEE
113views Database» more  IDEAS 2002»
15 years 11 months ago
Scalable QoS-Aware Disk-Scheduling
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
Walid G. Aref, Khaled El-Bassyouni, Ibrahim Kamel,...