34 search results - page 3 / 7 » On the volume of sets bounded by refinable functions |
APVIS
2011
12 years 8 months ago
2011
We present an efficient method for volume rendering by raycasting on the CPU. We employ coherent packet traversal of an implicit bounding volume hierarchy, heuristically pruned u...
VLSID
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
CRV
2011
IEEE
12 years 8 months ago
2011
IEEE
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
IPMI
2007
Springer
14 years 9 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...