Sciweavers

562 search results - page 98 / 113
» Algorithm Visualization: The State of the Field
Sort
View
PAMI
2012
12 years 12 months ago
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
—We present a novel framework to generate and rank plausible hypotheses for the spatial extent of objects in images using bottom-up computational processes and mid-level selectio...
João Carreira, Cristian Sminchisescu
ITICSE
2005
ACM
15 years 3 months ago
A prolog toolkit for formal languages and automata
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
Michel Wermelinger, Artur Miguel Dias
ICMCS
2010
IEEE
849views Multimedia» more  ICMCS 2010»
14 years 10 months ago
High Dynamic Range image tone mapping based on local Histogram Equalization
High Dynamic Range (HDR) images can represent the acquired scene with a greater dynamic range of luminance than classical Low Dynamic Range (LDR) ones. Despite the recent diffusio...
Alberto Boschetti, Nicola Adami, Riccardo Leonardi...
TCSV
2010
14 years 4 months ago
Perceptually Unequal Packet Loss Protection by Weighting Saliency and Error Propagation
We describe a method for achieving perceptually minimal video distortion over packet-erasure networks using perceptually unequal loss protection (PULP). There are two main ingredie...
Hojin Ha, Jincheol Park, Sanghoon Lee, Alan Conrad...
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner