Results 111 to 120 of about 8,591 (298)
Efficiency of orthogonal super greedy algorithm under the restricted isometry property
We investigate the efficiency of orthogonal super greedy algorithm (OSGA) for sparse recovery and approximation under the restricted isometry property (RIP).
Xiujie Wei, Peixin Ye
doaj +1 more source
A Review on Sensor Technologies, Control Approaches, and Emerging Challenges in Soft Robotics
This review provides an introspective of sensors and controllers in soft robotics. Initially describing the current sensing methods, then moving on to the control methods utilized, and finally ending with challenges and future directions in soft robotics focusing on the material innovations, sensor fusion, and embedded intelligence for sensors and ...
Ean Lovett +5 more
wiley +1 more source
Lower-order refinements of greedy approximation
For two countable ordinals α and β, a basis of a Banach space X is said to be (α,β)-quasi-greedy if it is ∙ quasi-greedy, ∙ Sα-unconditional but not Sα+1-unconditional, and ∙ Sβ-democratic but not Sβ+1-democratic. If α or β is replaced with ∞, then the basis is required to be unconditonal or democratic, respectively.
Beanland, Kevin +3 more
openaire +2 more sources
Greedy Kernel Approximation for Sparse Surrogate Modeling
Modern simulation scenarios frequently require multi-query or real-time responses of simulation models for statistical analysis, optimization, or process control.
Gabriele Santin +3 more
core +1 more source
Embedded flexible sensing technologies advance underwater soft robotics, yet most systems still suffer from hysteresis and limited perceptiveness. Instead, vision‐based tactile sensors provide reliable and rapid feedback essential for complex underwater tasks.
Qiyi Zhang +5 more
wiley +1 more source
On greedy approximation in complex Banach spaces
The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently some results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real Banach spaces were extended to the case of complex Banach spaces.
Alexander Vladimirovich Gasnikov +1 more
openaire +3 more sources
Automated analysis of weighted voting games
Weighted voting games (WVGs) are an important mechanism for modeling scenarios where a group of agents must reach agreement on some issue over which they have different preferences.
Jennings, Nick +8 more
core +1 more source
Nonlocomotory Robotic Strategies for Dynamic Rotation Control in Terrestrial Robots: A Review
Terrestrial robots increasingly require rapid body rotation to maintain stability and agility in complex environments. This review shows nonlocomotory rotational control strategies that operate without ground contact, including reaction wheels, tails, bars, limbs, and thrusters.
Y. Liang +14 more
wiley +1 more source
Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek +3 more
wiley +1 more source
Simple Stopping Criteria for Information Theoretic Feature Selection
Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between
Shujian Yu, José C. Príncipe
doaj +1 more source

