Sciweavers

495 search results - page 64 / 99
» Data exchange: computing cores in polynomial time
Sort
View
ICVGIP
2008
13 years 10 months ago
Ray Casting Deformable Models on the GPU
The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with programming m...
Suryakant Patidar, P. J. Narayanan
DLOG
2007
13 years 11 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
14 years 3 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
ALT
1998
Springer
14 years 1 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
STACS
2010
Springer
14 years 3 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...