171 search results - page 32 / 35 » On Chebyshev Polynomials of Matrices |
122
Voted
ICRA
1999
IEEE
15 years 7 months ago
1999
IEEE
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 ...
146
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
116
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
125
click to vote
IOR
2008
15 years 3 months ago
2008
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
123
click to vote
EOR
2007
15 years 3 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...