3702 search results - page 146 / 741 » All Pairings Are in a Group |
154
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical reso...
156
click to vote
JPDC
2008
15 years 6 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
141
click to vote
JSYML
2006
15 years 6 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
163
click to vote
SACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
109
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together thro...