A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Master index volumes 51–60
1988
Theoretical Computer Science
Preserved Fulltext
Yishkin, Match@ patteras in strings subjeu to muWiaear transformations (in: FlrnsancnIor St&W 60 (3) (1988) 231-254 Engeikkt, J. and 6. ...
., tXn&atioa d'we section des classes de aoajugahon et arbrc des mats de Lyadoo de hgueur borate (ia: Fatdimenti St&es) 60 (3) (1988) 255-283 Eilam-Taxeff, T. and U. ...
doi:10.1016/0304-3975(88)90111-9
fatcat:5ubltwbblfhsvfui7i6lggww4y
Author index volume 60 (1988)
1988
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Master index volumes 51–60
1988
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
., Gn the computational complexity of the abelian permutation group structure, membership and intersectioa problems 56 (2) (1988) 211-222 Iwata, S. and T. ...
doi:10.1016/0304-3975(88)90118-1
fatcat:cryaruveyfbvzkp7tfzxduxyry
Master index to volumes 51–60
1995
Journal of Computational and Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Zhu, Methods with high accuracy for finite element probability computing P~rez Riera, M. and J.L. ...
Fukushima, M., see Sugimoto, T.
52
(1994)
60 (1-2) (1995)
58 (3) (1995)
60 (1-2) (1995)
177-198
47-62
237-253
219-236
Smirnov, Yu.F., see Campigotto, C. So, J.W. ...
doi:10.1016/0377-0427(95)90111-6
fatcat:hgbeobt7hzcxlgm4p4xch5ziau
Non-overlapping Volume Decomposition Using Maximum Volumes
최대볼륨을 활용한 비교차 볼륨분해
2014
Korean Journal of Computational Design and Engineering
최대볼륨을 활용한 비교차 볼륨분해
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The non-overlapping volume decomposition finds non-overlapped volumes from maximum volumes. ...
In this paper, we propose a non-overlapping volume decomposition method that decomposes a solid model into non-overlapped volumes. ...
김 병철은 셀 기반 분해에 랩어라운드(wrap-around) 와 볼륨분할(volume split)을 적용한 단계적 볼륨 분해(stepwise volume decomposition) [ [22, 23] . Fig. 2(a) ). Fig. 2(c) ). ...
doi:10.7315/cadcam.2014.050
fatcat:rx3cuevmfbc3pacfuehz46cjmq
Parallel multigrid finite volume computation of three-dimensional thermal convection
1999
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The algebraic equations resulting from the finite volume discretization, including a pressure equation which consumes most of the computation time, are solved by a parallel multigrid method. ...
A parallel implementation of the finite volume method for three-dimensional, timedependent, thermal convective flows is presented. ...
Access to the Intel Paragon at the Jet Propulsion Laboratory, California Institute of Technology, was provided by the NASA High Performance Computing and Communications Program. ...
doi:10.1016/s0898-1221(99)00113-3
fatcat:ujaavqjyebhl3ob6ukxopboxwa
Downsampling and Storage of Pre-Computed Gradients for Volume Rendering
[article]
2017
Spanish Computer Graphics Conference (CEIG)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The way in which gradients are computed in volume datasets influences both the quality of the shading and the performance obtained in rendering algorithms. ...
An obvious solution is to pre-compute the gradients and store them. Unfortunately, this originates two problems: First, the downsampling process, that is also prone to generate artifacts. ...
Introduction The visualization of volume datasets by means of volume rendering algorithms is a demanding task that requires a high degree of computational power and resources. ...
doi:10.2312/ceig.20171208
dblp:conf/ceig/Diaz-GarciaBNV17
fatcat:7wn6jvkxpncfrhgp6wnfmszqt4
Finite Volume Solutions of Convection-Diffusion Test Problems
1993
Mathematics of Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The cell-vertex formulation of the finite volume method has been developed and widely used to model inviscid flows in aerodynamics: more recently, one of us has proposed an extension for viscous flows. ...
role in computational fluid dynamics. ...
Figure 5 (a) (see p. 195) shows the computed solutions using the finite volume method at the three stations y = 0.9, y = 0.5 and y = 0, for the four values of e which were considered in the first problem ...
doi:10.2307/2153161
fatcat:o3r2xljgdjdnbpiqtt6yswlxxm
Finite volume solutions of convection-diffusion test problems
1993
Mathematics of Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The cell-vertex formulation of the finite volume method has been developed and widely used to model inviscid flows in aerodynamics: more recently, one of us has proposed an extension for viscous flows. ...
role in computational fluid dynamics. ...
Figure 5 (a) (see p. 195) shows the computed solutions using the finite volume method at the three stations y = 0.9, y = 0.5 and y = 0, for the four values of e which were considered in the first problem ...
doi:10.1090/s0025-5718-1993-1153168-0
fatcat:x4s3ysnakfaylo6vipmtfq4msi
Robust Finite Volume Schemes for Two-Fluid Plasma Equations
2013
Journal of Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
ROBUST FINITE VOLUME SCHEMES FOR TWO-FLUID PLASMA EQUATIONS 5 Numerical methods to solve (1.3) are based on the finite volume methods [11] . ...
ROBUST FINITE VOLUME SCHEMES FOR TWO-FLUID PLASMA EQUATIONS 7 2.1.1. HLLC based numerical flux for two-fluid equations. ...
doi:10.1007/s10915-013-9809-6
fatcat:zjp7pla3a5b2jplup4tnerjh2e
Approximating the Bandwidth via Volume Respecting Embeddings
2000
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our algorithm is based on a new notion, called volume respecting embeddings, which is a natural extension of small distortion embeddings of Bourgain and of Linial, London and Rabinovich. ...
Computing volumes Theorem 3 shows that Vol(S) can be approximated within a factor of 2 (jSj?2)=2 in polynomial time, by computing Tvol(S). ...
We wish to compute Vol(S). For the tree G (and hence for the tree metric space (S; d)), we introduce a notion of tree volume that is de ned as Tvol(S) = n i=2 i . ...
doi:10.1006/jcss.1999.1682
fatcat:agluodkptfgqxdjz7byc3sqsaa
An Efficient Navigation Method for Virtual Endoscopy Using Volume Ray Casting
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose an efficient navigation algorithm that calculates depth information while rendering a scene for current frame with volume ray casting method, then computes new viewing specification of camera ...
The volume data used for the experiment is a clinical volume obtained by scanning a human abdomen with a spiral CT (computed tomography) with resolution 541 512 512 × × . ...
Calculating Depth Information Volume ray casting fires a ray from each pixel on the view plane into volume space, then it computes color and opacity on sample points along the ray and determines final ...
doi:10.1007/3-540-44863-2_7
fatcat:hc6r3uxgunh4jcjjn2aajuhdhe
On the finite-volume Lattice Boltzmann modeling of thermo-hydrodynamics
2010
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, Thermal Finite-Volume Lattice Boltzmann Method is developed. To demonstrate the temperature field, the Double Distribution Function (DDF) of thermal lattice Boltzmann equation is used. ...
In present work, the explained boundary method coupled with the cell-centered finite-volume method which improved the computational efficiency. ...
A cell-centered finite volume on arbitrary cells is shown in Fig. 1 . ...
doi:10.1016/j.camwa.2010.05.011
fatcat:g5qlkb2z3zagxejc4mx3bkrdxu
Rigidity and Volume Preserving Deformation on Degenerate Simplices
2017
Discrete & Computational Geometry
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:math/0702601v3 fatcat:rmb3k5sex5bebcwi6gpj4tsp4aOther Versions
sufficiently small motion must preserve the volumes of all k-faces; and this property still holds in M^d for d≥ n+1 if an invariant c_k-1(α^k-1) of the degenerate simplex has the desired sign. ...
We prove that if the vertices of the simplex vary smoothly in M^d for d=n, and the volumes of k-faces in one subset are constrained only to decrease while in the other subset only to increase, then any ...
In the computation of the volume of the simplices in S n and H n , we find an interesting application of the Schläfli differential formula. ...
doi:10.1007/s00454-017-9956-x
fatcat:w4larp3ijfgzlkjany7hyfwzua
Detecting Abnormal Activities using Computer Vision in Big Data Framework
2020
VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The abnormal behaviour of any person can be detected using computer vision. ...
Various techniques can be used in the field of computer vision feature extraction and description scheme. ...
Spatio-temporal volumes are built close every pixel, and then the activity pattern codebook is constructed by clustering those volumes. ...
doi:10.35940/ijitee.j1013.08810s219
fatcat:nidixlsl7nf3zdgq4nfaix3nyq
« Previous
Showing results 1 — 15 out of 1,420,061 results