107,713 Hits in 5.5 sec

One-dimensional optimization on multiprocessor systems

Mark A. Franklin, Norman L. Soong
1981 IEEE transactions on computers  
The multiple processors in this case speed up the optimi zation process by permitting the implementation of a parallel function evaluation algorithm.  ...  The strategies will be referred to as the P/S (i.e., parallel evaluation/ sequential optimization) and S/P (i.e., sequential evaluation/parallel optimization) strategies.  ... 
doi:10.1109/tc.1981.6312157 fatcat:l5ketu7lmrg5nhybwk5jqkpyki

Multi-View Data Visualization Based Big Data Analysis Using Clustering Similarity Measure

Srinivasa Rao Madala, Rajavarman V N, Venkata Satya Vivek T
2017 International Journal of Engineering and Technology  
Similarity measure is a categorization property to represent data with relationship objects in data set evaluation with different pair of attributes.  ...  Parallel co-ordinate is an efficient and effective data visualization tool to analyze and handle multi attribute high dimensional data.  ...  Comparable facilitate plots, as a straightforward however capable geometrical high-dimensional information creation strategy and symbolizes N-dimensional data in a 2-dimensional zone with factual meticulousness  ... 
doi:10.21817/ijet/2017/v9i3/1709030284 fatcat:fqfszjomlfhethhk6gwties3yu

Parallelization strategies for markerless human motion capture

Alberto Cano, Enrique Yeguas-Bolivar, Rafael Muñoz-Salinas, Rafael Medina-Carnicer, Sebastián Ventura
2014 Journal of Real-Time Image Processing  
This paper presents an efficient approach to parallelize the evaluation of the solutions in CPUs and GPUs.  ...  Multiple algorithm's configurations were tested to analyze the best trade-off in regard to the accuracy and computing time.  ...  An efficient and commonly-used parallelization strategy using multi-core CPUs is the population parallel approach, which operates by multiple candidate solutions being evaluated in parallel by separate  ... 
doi:10.1007/s11554-014-0467-1 fatcat:wjmqqlbsxrhw3ncac72evkznwy

A distributed approach for accelerating sparse matrix arithmetic operations for high-dimensional feature selection

Antonela Tommasel, Daniela Godoy, Alejandro Zunino, Cristian Mateos
2016 Knowledge and Information Systems  
The performance of the presented approach was evaluated considering a high-dimensional text feature selection approach and two real-world datasets.  ...  This work proposes a novel approach for distributing sparse-matrix arithmetic operations on computer clusters aiming at speeding-up the processing of high-dimensional matrices.  ...  The strategies are applied to the most common operations: Addition-Subtraction, Matrix Multiplication and a combination of both, known as Laplacian, applied to a high-dimensional social feature selection  ... 
doi:10.1007/s10115-016-0981-5 fatcat:isawn5cyxrhuxm7hupjwz7bx34

Page 4342 of Psychological Abstracts Vol. 81, Issue 10 [page]

1994 Psychological Abstracts  
The aim of this article is to provide a conceptual overview of clinical re- search hypotheses that invite evaluation as structural equation models.  ...  —Presents a proce- dure that transforms an n-dimensional scatter diagram into a 2- dimensional scatter diagram while preserving proximity relation- ships between points.  ... 


Milos Nikolic, Mohammed ElSeidy, Christoph Koch
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
As a consequence, our techniques make incremental view maintenance of linear algebra practical and usually substantially cheaper than re-evaluation.  ...  view maintenance to lose its performance benefit over re-evaluation.  ...  The re-evaluation strategy first applies ∆A to A and then performs two O(n 3 ) 1 matrix multiplications to update C.  ... 
doi:10.1145/2588555.2610519 dblp:conf/sigmod/NikolicEK14 fatcat:irczeo5myzd4rmfotm4n5jciei

A Visual Analytics Interface for Formulating Evaluation Metrics of Multi-dimensional Time-series Data

Rei Takami, Hiroki Shibata, Yasufumi Takama
2021 IEEE Access  
scatter-plot view but also lines in the parallel coordinates of the detailed view Fig. 1 (b2) .  ...  This view consists of a list of objects selected from the scatter-plot view ( Fig. 1(b1) ), a line chart of changes in X and Y coordinates of o n (p tn ) ( Fig. 1(b2) ), and parallel coordinates representing  ...  He is currently working as a software engineer at Yahoo Japan Corporation, Tokyo. His main research interest includes information visualization and visual analytics of time-series data. HIROKI  ... 
doi:10.1109/access.2021.3098621 fatcat:veirs4q2nnfn3odls7d2nqui6i

Improved temporal resolution for functional studies with reduced number of segments with three-dimensional echo planar imaging

Mayur Narsude, Wietske van der Zwaag, Tobias Kober, Rolf Gruetter, José P. Marques
2013 Magnetic Resonance in Medicine  
Purpose: To introduce a new k-space traversal strategy for segmented three-dimensional echo planar imaging (3D EPI) that encodes two partitions per radiofrequency excitation, effectively reducing the number  ...  Results: Whole brain images with a nominal voxel size of 2 mm isotropic could be acquired with a temporal resolution under half a second using traditional parallel imaging acceleration up to 4Â in the  ...  Echo volume imaging or single-shot three-dimensional (3D) EPI (4, 5) is a technique where a thick slab is excited and multiple partitions are encoded within the thick slab during a single readout. 3D  ... 
doi:10.1002/mrm.24975 pmid:24136782 fatcat:mqmehfvssjbtbp6wnukntb35y4

Generative Adversarial Parallelization [article]

Daniel Jiwoong Im, He Ma, Chris Dongjoo Kim, Graham Taylor
2016 arXiv   pre-print
We propose Generative Adversarial Parallelization, a framework in which many GANs or their variants are trained simultaneously, exchanging their discriminators.  ...  This eliminates the tight coupling between a generator and discriminator, leading to improved convergence and improved coverage of modes.  ...  Then to evaluate each model quantitatively, we apply the GAM-II metric which is a re-formulation of GAM (Im et al., 2016) which can be used to compare different GAN architectures.  ... 
arXiv:1612.04021v1 fatcat:gxnliag4ija5fc4tc2hxk64dvu

Page 38 of Psychological Abstracts Vol. 81, Issue 1 [page]

1994 Psychological Abstracts  
—Proposes a cognitive model for the percep- tion and translation of a 3-dimensional object or array onto a 2- dimensional surface. Based on the premise that the mind is 38  ...  (U British Columbia, Faculty of Educa- tion, Vancouver, Canada) A cognitive model for the and translation of a three-dimensional object/array onto a two- dimensional surface.  ... 

Dynamic Scheduling for Progressive Large-Scale Visualization [article]

Markus Flatken, Anne Berres, Jonas Merkel, Ingrid Hotz, Andreas Gerndt, Hans Hagen
2015 Eurographics Conference on Visualization  
This requires a dynamic scheduling of data chunks on the parallel post-processing system which has been implemented by using an R-Tree.  ...  In this paper, we demonstrate the efficiency of our implementation for view-dependent feature extraction with varying viewpoints.  ...  [BCH12]re are many examples for specific use cases and algorithmic challenges in distributed and parallel visualization[BCH12].  ... 
doi:10.2312/eurovisshort.20151122 dblp:conf/vissym/FlatkenBMHGH15 fatcat:dayei5vmrzetffwykjzfa7mssq

Compiler Technology for Parallel Scientific Computation

Can Özturan, Balaram Sinharoy, Boleslaw K. Szymanski
1994 Scientific Programming  
Our approach is based on a program decomposition, parallel code synthesis, and run-time support for parallel scientific computation.  ...  The synthesis of parallel code is based on configurations that describe the overall computation as a set of interacting components.  ...  The content of this entry does not necessarily re ect the position or policy of the U.S. Government|no o cial endorsements should be inferred or implied.  ... 
doi:10.1155/1994/243495 fatcat:v3abg7bkkzbmnix2w5kplpvyau

Uncertainty-Aware Exploration of Continuous Parameter Spaces Using Multivariate Prediction

W. Berger, H. Piringer, P. Filzmoser, E. Gröller
2011 Computer graphics forum (Print)  
Systems projecting a continuous n-dimensional parameter space to a continuous m-dimensional target space play an important role in science and engineering.  ...  If evaluating the system is expensive, however, an analysis is often limited to a small number of sample points.  ...  Stochastic sampling captures effects of varying multiple parameters at a time, and scales to a high dimensionality of X.  ... 
doi:10.1111/j.1467-8659.2011.01940.x fatcat:ly4dwjk33ve77bq4uifbqb2k3y

Advances and Research Directions in Data-Warehousing Technology

Mukesh Mohania, Sunil Samtani, John Roddick, Yahiko Kambayashi
1999 Australasian Journal of Information Systems  
We also discuss recent developments in data warehouse modelling, view selection and maintenance, indexing schemes, parallel query processing and data mining issues.  ...  In this paper, we present a n o verview of data warehousing, multi-dimensional databases, OLAP and data mining technology and discuss the directions of current research in the area.  ...  The view selection algorithm tries to minimize the average time required to evaluate a view and also keeps a constraint on the space requirements.  ... 
doi:10.3127/ajis.v7i1.287 fatcat:ksb52g7i2rfu7a7bqywdqcchzy

Graph visualisation by concurrent differential evolution

P. Krömer, M. Prílepok, J. Platoš, V. Snášel
2015 Neural Network World  
A representative dimensionality reduction is an important step in the analysis of real-world data.  ...  They often feature a combination of high dimensionality, large volume, and vague, loosely defined structure.  ...  In general, parallel evolutionary metaheuristics evolve multiple candidate solutions or populations of solutions side by side.  ... 
doi:10.14311/nnw.2015.25.019 fatcat:iyyd7v67hjfx3amsivaov2e7te
« Previous Showing results 1 — 15 out of 107,713 results