Sciweavers

2297 search results - page 204 / 460
» An Algorithm for Computing the Integral Closure
Sort
View
123
Voted
CGI
2004
IEEE
15 years 7 months ago
Depicting Shape Features with Directional Strokes and Spotlighting
This paper presents a new algorithm and technique for rendering triangular surfaces in pen-and-ink edge-based strokes. Our technique integrates two very important illustration str...
Mario Costa Sousa, Faramarz F. Samavati, Meru Brun...
AAAI
2007
15 years 6 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
DAC
2005
ACM
15 years 5 months ago
A green function-based parasitic extraction method for inhomogeneous substrate layers
This paper presents a new Green function-based approach for substrate parasitic extraction in substrates with inhomogeneous layers. This new formulation allows analysis of noise c...
Chenggang Xu, Ranjit Gharpurey, Terri S. Fiez, Kar...
FMOODS
2007
15 years 5 months ago
Model Checking of Extended OCL Constraints on UML Models in SOCLe
We present the first tool that offers dynamic verification of extended traints on UML models. It translates a UML model into an Abstract State (ASM) which is transformed by an AS...
John Mullins, Raveca Oarga
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 3 months ago
Fast GPGPU Data Rearrangement Kernels using CUDA
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
Michael Bader, Hans-Joachim Bungartz, Dheevatsa Mu...