Sciweavers

5022 search results - page 58 / 1005
» Data structures and problem solving using Java
Sort
View
CGF
2006
155views more  CGF 2006»
14 years 9 months ago
Opacity Peeling for Direct Volume Rendering
The most important technique to visualize 3D scalar data, as they arise e.g. in medicine from tomographic measurement, is direct volume rendering. A transfer function maps the sca...
Christof Rezk-Salama, Andreas Kolb
ENTCS
2007
116views more  ENTCS 2007»
14 years 9 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
JCC
2006
110views more  JCC 2006»
14 years 9 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
FIDJI
2003
Springer
15 years 3 months ago
Model Generation for Distributed Java Programs
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
Rabéa Boulifa, Eric Madelaine
CF
2009
ACM
15 years 4 months ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt