Sciweavers

7380 search results - page 381 / 1476
» time 2008
Sort
View
DAM
2002
82views more  DAM 2002»
15 years 6 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
161
Voted
CGF
1999
70views more  CGF 1999»
15 years 6 months ago
Modelling and Rendering Graphics Scenes Composed of Multiple Volumetric Datasets
This paper presents a method for modelling graphics scenes consisting of multiple volumetric objects. A twolevel hierarchical representation is employed, which enables the reducti...
Adrian Leu, Min Chen
CSUR
1999
83views more  CSUR 1999»
15 years 6 months ago
Versioning hypermedia
: Keeping multiple versions of the same electronic artifact is a necessity in many authoring fields, and a serious advantage in all of them. Hypermedia adds to that the issue of re...
Fabio Vitali
DM
1999
61views more  DM 1999»
15 years 6 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
SIAMAM
2002
122views more  SIAMAM 2002»
15 years 6 months ago
A Level Set Method for Anisotropic Geometric Diffusion in 3D Image Processing
A new morphological multiscale method in 3D image processing is presented which combines the image processing methodology based on nonlinear diffusion equations and the theory of g...
Martin Rumpf, Tobias Preußer