Sciweavers

12 search results - page 2 / 3
» Grasping Infinity by Finite Sets
Sort
View
AUTOMATICA
2004
77views more  AUTOMATICA 2004»
13 years 6 months ago
Non-asymptotic quality assessment of generalised FIR models with periodic inputs
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
Marco C. Campi, Su Ki Ooi, Erik Weyer
IJRR
2008
107views more  IJRR 2008»
13 years 6 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 18 days ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 3 months ago
A Generalized Coupon Collector Problem
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
Weiyu Xu, Ao Kevin Tang
DCG
2002
106views more  DCG 2002»
13 years 6 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky