Sciweavers

1297 search results - page 61 / 260
» Dynamic Object Process Graphs
Sort
View
ICIP
2010
IEEE
14 years 11 months ago
Objective assessment of tone mapping algorithms
There has been a growing interest in recent years to develop tone mapping algorithms that can convert high dynamic range (HDR) to low dynamic range (LDR) images, so that they can ...
Hojatollah Yeganeh, Zhou Wang
134
Voted
POS
1994
Springer
15 years 6 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
15 years 8 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
CVPR
2007
IEEE
15 years 8 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
BXML
2003
15 years 3 months ago
Towards Automatic Selection of Web Services Using Graph Transformation Rules
: The Web service architecture promises to be highly dynamic. The idea is that a service requester can discover a needed service at runtime. Due to the fact that this discovery pro...
Jan Hendrik Hausmann, Reiko Heckel, Marc Lohmann