Accelerating Linear System Solutions Using Randomization Techniques
نویسندگان
چکیده
منابع مشابه
Using randomization techniques to analyse behavioural data
Data from behavioural studies are frequently non-normally distributed and cannot be analysed with traditional parametric statistics. Instead, behaviourists must rely on rank-transformation tests, which lose potentially valuable information present in the data. Recently, however, biologists in other disciplines have resolved similar statistical difficulties by using resampling methods. Results f...
متن کاملRandomization Techniques for Graphs
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those results is lacking. Within the framework of statistical hypothesis testing, we focus in this paper on randomization techniques for unweighted undirected graphs. Randomization is an important approach to assess the statisti...
متن کاملLinear Programming { Randomization
Frameworks ? Bernd Gartner and Emo Welzl Institut f ur Informatik, Freie Universitat Berlin, Takustr. 9, D-14195 Berlin, Germany fgaertner,[email protected] Abstract. Recent years have brought some progress in the knowledge of the complexity of linear programming in the unit cost model, and the best result known at this point is a randomized `combinatorial' algorithm which solves a linea...
متن کاملAnalysis of speech under stress using Linear techniques and Non-Linear techniques for emotion recognition system
Analysis of speech for recognition of stress is important for identification of emotional state of person. This can be done using ‘Linear Techniques’, which has different parameters like pitch, vocal tract spectrum, formant frequencies, Duration, MFCC etc. which are used for extraction of features from speech. TEO-CB-Auto-Env is the method which is non-linear method of features extraction. Anal...
متن کاملSolutions of Fuzzy Linear Systems using Ranking function
In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2013
ISSN: 0098-3500,1557-7295
DOI: 10.1145/2427023.2427025