Sciweavers

98 search results - page 6 / 20
» On the Determination of the Optimum Path in Space
Sort
View
GLOBECOM
2010
IEEE
13 years 4 months ago
Energy-Efficient Power Loading for a MIMO-SVD System and Its Performance in Flat Fading
In this paper we formulate a power loading problem for the spatial subchannels (parallel channels) of a single-carrier MIMO-SVD system. The power loading solution is designed to mi...
Raghavendra S. Prabhu, Babak Daneshrad
IJRR
2002
87views more  IJRR 2002»
13 years 6 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 1 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
MP
2010
156views more  MP 2010»
13 years 5 months ago
Representing the space of linear programs as the Grassmann manifold
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
Gongyun Zhao
ICML
2007
IEEE
14 years 7 months ago
A kernel path algorithm for support vector machines
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky