Sciweavers

1523 search results - page 94 / 305
» The Computational Complexity of Linear Optics
Sort
View
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
14 years 1 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
AIPS
2007
13 years 11 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 9 months ago
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs. Linear Precoding
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
Juyul Lee, Nihar Jindal
ICIC
2009
Springer
14 years 1 months ago
Dimension Reduction Using Semi-Supervised Locally Linear Embedding for Plant Leaf Classification
Plant has plenty use in foodstuff, medicine and industry, and is also vitally important for environmental protection. So, it is important and urgent to recognize and classify plant...
Shanwen Zhang, Kwok-Wing Chau
JSCIC
2007
89views more  JSCIC 2007»
13 years 8 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa