Sciweavers

52 search results - page 11 / 11
» Numerical algebraic geometry and symbolic computation
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
IJRR
2002
92views more  IJRR 2002»
14 years 11 months ago
On Fitted Stratified and Semi-Stratified Geometric Manipulation Planning with Fingertip Relocations
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...
István Harmati, Béla Lantos, Shahram...