Sciweavers

2542 search results - page 37 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ICRA
2010
IEEE
100views Robotics» more  ICRA 2010»
13 years 6 months ago
Weighted barrier functions for computation of force distributions with friction cone constraints
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
Per Henrik Borgstrom, Maxim A. Batalin, Gaurav S. ...
SAMOS
2010
Springer
13 years 6 months ago
Accelerating high-level engineering computations by automatic compilation of Geometric Algebra to hardware accelerators
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
Jens Huthmann, Peter Muller, Florian Stock, Dietma...
JMLR
2012
11 years 10 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
IPPS
2000
IEEE
14 years 2 days ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
TMC
2002
106views more  TMC 2002»
13 years 7 months ago
Optimal Resource Management in Wireless Multimedia Wideband CDMA Systems
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
Majid Soleimanipour, Weihua Zhuang, George H. Free...