Sciweavers

188 search results - page 22 / 38
» Solving Rational Eigenvalue Problems via Linearization
Sort
View
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
14 years 4 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake
GLOBECOM
2010
IEEE
13 years 7 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
CVPR
2010
IEEE
14 years 6 months ago
Specular Surface Reconstruction from Sparse Reflection Correspondences
We present a practical approach for surface reconstruction of smooth mirror-like objects using sparse reflection correspondences (RCs). Assuming finite object motion with a fix...
Aswin Sankaranarayanan, Ashok Veeraraghavan, Oncel...
DGCI
2008
Springer
13 years 11 months ago
Statistical Template Matching under Geometric Transformations
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
Alexander Sibiryakov
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...