Results 21 to 30 of about 4,158,166 (297)
Non-convex approach to binary compressed sensing [PDF]
, 2018 We propose a new approach to the recovery of binary signals in compressed sensing, based on the local minimization of a non-convex cost functional. The desired signal is proved to be a local minimum of the functional under mild conditions on the sensing ...
Fosson, Sophie M.
core +2 more sources
Randomized Algorithms for Minimum Distance Localization [PDF]
The International Journal of Robotics Research, 2005 The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2 D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing.
Malvika Rao +2 more
openaire +1 more source
A local minimum theorem and critical nonlinearities
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In this paper the existence of two positive solutions for a Dirichlet problem having a critical growth, and depending on a real parameter, is established.
Bonanno Gabriele +2 more
doaj +1 more source
Minimum local analgesic concentration of local anaesthetics
Continuing Education in Anaesthesia Critical Care & Pain, 2010 The minimum local analgesic concentration (MLAC) model was first described in 1995. The idea was to develop a clinical model for local anaesthetic drugs, similar to that which was in routine use for inhalation anaesthetics, the minimum alveolar concentration (MAC).
Malachy Columb, Iain Gall
openaire +1 more source
The Determination Of Reddening From Intrinsic VR Colors Of RR Lyrae Stars [PDF]
, 2009 New R-band observations of 21 local field RR Lyrae variable stars are used to explore the reliability of minimum light (V-R) colors as a tool for measuring interstellar reddening.
Alcock +34 more
core +3 more sources
Simple PTAS's for families of graphs excluding a minor [PDF]
, 2015 We show that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor.Comment: To appear in ...
Cabello, Sergio, Gajser, David
core +1 more source
Road Pavement Damage Detection Based on Local Minimum of Grayscale and Feature Fusion
Applied Sciences, 2022 In this work, we propose a road pavement damage detection deep learning model based on feature points from a local minimum of grayscale. First, image blocks, consisting of the neighborhood of feature points, are cut from the image window to form an image
Wei-Wei Jin +7 more
doaj +1 more source
TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs
Sensors, 2023 The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem aiming to find the smallest set of vertices such that every edge has at least one endpoint in the set.
Yu Zhang +3 more
doaj +1 more source
Minimum error sound source localization [PDF]
The Journal of the Acoustical Society of America, 1994 A novel approach to the problem of computing the direction of arrival (DOA) of a sound source using a two-element microphone array is presented. Typically, the DOA is computed by peak picking from the resulting cross-correlation function. In order to improve such estimates it is usually desirable to pre-filter the signals prior to cross correlation ...
openaire +1 more source
On minimum locally $n$-(arc)-strong digraphs [PDF]
Czechoslovak Mathematical Journal, 1996 Let \(n\geq 1.\) A digraph \(D\) is called \(n\)-strong (\(n\)-arc-strong) if any removal of fewer than \(n\) vertices (arcs, respectively) from \(D\) results in a nontrivial strong digraph. A digraph is called locally \(n\)-strong (locally \(n\)-arc-strong) if the neighborhood of each vertex is \(n\)-strong (\(n\)-arc-strong, respectively).
openaire +1 more source