Results 71 to 80 of about 87,394 (276)
Adaptive Segmentation of Streaming Sensor Data on Edge Devices
Sensors, 2021 Sensor data streams often represent signals/trajectories which are twice differentiable (e.g., to give a continuous velocity and acceleration), and this property must be reflected in their segmentation. An adaptive streaming algorithm for this problem is
Roman Dębski, Rafał Dreżewski
doaj +1 more source
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
A new greedy search method for the design of digital IIR filter
Journal of King Saud University: Computer and Information Sciences, 2015 A new greedy search method is applied in this paper to design the optimal digital infinite impulse response (IIR) filter. The greedy search method is based on binary successive approximation (BSA) and evolutionary search (ES). The suggested greedy search
Ranjit Kaur +2 more
doaj +1 more source
Approximate and Stochastic Greedy Optimization
, 2017 15 ...
Ye, Nan, Bartlett, Peter
openaire +2 more sources
Simultaneous sparse approximation via greedy pursuit [PDF]
Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006 A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary signals drawn from a large, linearly dependent collection. An important generalization is simultaneous sparse approximation.
Tropp, J. A. +2 more
openaire +2 more sources
Approximation Bounds For Minimum Degree Matching [PDF]
, 2015 We consider the MINGREEDY strategy for Maximum Cardinality Matching. MINGREEDY repeatedly selects an edge incident with a node of minimum degree. For graphs of degree at most $\Delta$ we show that MINGREEDY achieves approximation ratio at least $ \frac ...
Besser, Bert
core
Keyword-aware Optimal Route Search
, 2012 Identifying a preferable route is an important problem that finds applications in map services. When a user plans a trip within a city, the user may want to find "a most popular route such that it passes by shopping mall, restaurant, and pub, and the ...
Cao, Xin +3 more
core +2 more sources
Five‐Year Disease Progression in Synuclein Seeding Positive Sporadic Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To provide a comprehensive description of disease progression in synuclein seeding assay (SAA) positive sporadic Parkinson Disease participants, using Neuronal Synuclein Disease integrated biological and functional impairment staging framework.
Paulina Gonzalez‐Latapi +19 more
wiley +1 more source
RSU deployment planning based on approximation algorithm in urban VANET
Tongxin xuebao, 2018 To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the ...
Junyu ZHU +4 more
doaj +2 more sources
Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende +26 more
wiley +1 more source