6568 search results - page 76 / 1314 » Reducing the Complexity of Reductions |
141
click to vote
TSMC
2008
15 years 6 months ago
2008
We propose a technique to speedup the learning of the inverse kinematics of a robot manipulator by decomposing it into two or more virtual robot arms. Unlike previous decomposition...
154
click to vote
KBS
2002
15 years 5 months ago
2002
The automatic induction of classification rules from examples in the form of a decision tree is an important technique used in data mining. One of the problems encountered is the o...
114
click to vote
BC
2010
15 years 3 months ago
2010
We present two alternative mappings between a macroscopic neural mass model and a reduction of a conductance-based model. These provide possible explanations of the relationship b...
222
click to vote
NETWORKS
2011
14 years 9 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
140
Voted
COCO
1991
Springer
15 years 9 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...