Sciweavers

2957 search results - page 162 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 10 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
ISAAC
1998
Springer
72views Algorithms» more  ISAAC 1998»
15 years 10 months ago
Casting with Skewed Ejection Direction
Casting is a manufacturing process in which liquid is poured into a cast (mould) that has a cavity with the shape of the object to be manufactured. The liquid then hardens, after ...
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
COLT
1994
Springer
15 years 10 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
DIS
2007
Springer
15 years 10 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono