Results 101 to 110 of about 2,741,379 (327)
Claustrum Volume Is Reduced in Multiple Sclerosis and Predicts Disability
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The claustrum is a small, thin structure of predominantly gray matter with broad connectivity and enigmatic function. Little is known regarding the impact of claustrum pathology in multiple sclerosis (MS). Methods This study assessed whether claustrum volume was reduced in MS and whether reductions were associated with specific ...
Nicole Shelley +5 more
wiley +1 more source
A Probabilistic-Based Model for Binary CSP [PDF]
arXiv, 2016 This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the probability that a domain value becomes inconsistent, then it express the expectation of the number of arc ...
arxiv
Early Language Impairment as an Integral Part of the Cognitive Phenotype in Huntington's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Huntington's disease (HD) speech/language disorders have typically been attributed to motor and executive impairment due to striatal dysfunction. In‐depth study of linguistic skills and the role of extrastriatal structures in HD is scarce.
Arnau Puig‐Davi +13 more
wiley +1 more source
Performance Study of Cancer Selection/Classification Algorithms Based on Microarray Data
Applied Medical Informatics, 2014 Microarray data has an important role in detecting and classifying all types of cancer tissues. In cancer researches, relatively low number of samples in microarray has always caused some problems in designing classifiers.
Hamidreza SABERKARI +4 more
doaj
Histograms and Wavelets on Probabilistic Data [PDF]
arXiv, 2008 There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction techniques that can produce concise, accurate synopses of large probabilistic relations are crucial.
arxiv
Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis
Theoretical Computer Science, 1989 AbstractBy dynamic algorithms we mean algorithms that operate on dynamically varying data structures (dictionaries, priority queues, linear lists) subject to insertions I, deletions D, positive (negative) queries Q+ (Q−). Let us remember that dictionaries are implementable by unsorted or sorted lists, binary search trees, priority queues by sorted ...
Louchard, Guy +2 more
openaire +3 more sources
Development of a Disease Model for Predicting Postoperative Delirium Using Combined Blood Biomarkers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Postoperative delirium, a common neurocognitive complication after surgery and anesthesia, requires early detection for potential intervention. Herein, we constructed a multidimensional postoperative delirium risk‐prediction model incorporating multiple demographic parameters and blood biomarkers to enhance prediction accuracy ...
Hengjun Wan +7 more
wiley +1 more source
Network-Based Document Clustering Using External Ranking Loss for Network Embedding
IEEE Access, 2019 Network-based document clustering involves forming clusters of documents based on their significance and relationship strength. This approach can be used with various types of metadata that express the significance of the documents and the relationships ...
Yeo Chan Yoon +2 more
doaj +1 more source
Bounded Expectations: Resource Analysis for Probabilistic Programs [PDF]
arXiv, 2017 This paper presents a new static analysis for deriving upper bounds on the expected resource consumption of probabilistic programs. The analysis is fully automatic and derives symbolic bounds that are multivariate polynomials of the inputs. The new technique combines manual state-of-the-art reasoning techniques for probabilistic programs with an ...
arxiv
Probabilistic analysis of the greedy algorithm.
Труды Института системного программирования РАН, 2004 It is shown that the greedy algorithm in the average case (in some probabilistic model) finds almost minimum covers. It is shown also that in the average case the ratio of the size of minimum cover to the size of minimum fractional cover has logarithmic order in the size of the ground set.
openaire +2 more sources