Sciweavers

779 search results - page 132 / 156
» grid 2008
Sort
View
92
Voted
TSMC
1998
74views more  TSMC 1998»
14 years 9 months ago
An invariant performance measure for surface reconstruction using the volume between two surfaces
—In this paper, we propose the volume between two surfaces normalized by the surface area (interpreted as average distance between two surfaces) as an invariant quantitative meas...
June-Ho Yi, David M. Chelberg
TVCG
2002
156views more  TVCG 2002»
14 years 9 months ago
A Hardware-Assisted Scalable Solution for Interactive Volume Rendering of Time-Varying Data
We present a scalable volume rendering technique that exploits lossy compression and low-cost commodity hardware to permit highly interactive exploration of time-varying scalar vol...
Eric B. Lum, Kwan-Liu Ma, John Clyne
OIR
2008
87views more  OIR 2008»
14 years 9 months ago
E-science and information services: a missing link in the context of digital libraries
: Purpose: This paper analysis if and how far Library and Information Services (LIS) are supporting E-Science and Grid-Computing projects funded by authorities in the EU and German...
Achim Osswald
JMIV
2008
97views more  JMIV 2008»
14 years 9 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
14 years 8 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou