Sciweavers

2950 search results - page 25 / 590
» Computing with Infinitely Many Processes
Sort
View
FCCM
2009
IEEE
204views VLSI» more  FCCM 2009»
14 years 19 days ago
Acceleration and Energy Efficiency of a Geometric Algebra Computation using Reconfigurable Computers and GPUs
Geometric algebra (GA) is a mathematical framework that allows the compact description of geometric relationships and algorithms in many fields of science and engineering. The exe...
Holger Lange, Florian Stock, Andreas Koch, Dietmar...
CVPR
2012
IEEE
11 years 11 months ago
Evaluation of super-voxel methods for early video processing
Supervoxel segmentation has strong potential to be incorporated into early video analysis as superpixel segmentation has in image analysis. However, there are many plausible super...
Chenliang Xu, Jason J. Corso
ICONIP
1998
13 years 10 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
CADE
2005
Springer
14 years 9 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
JLP
2008
81views more  JLP 2008»
13 years 8 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange