Filters








101,061 Hits in 3.3 sec

The First Parameterized Algorithms and Computational Experiments Challenge

Holger Dell, Thore Husfeldt, Bart Jansen, Petteri Kaski, Christian Komusiewicz, Frances Rosamond
unpublished
In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge.  ...  Where did PACE come from, how did it go, who won, and what's next?  ...  Center for Mathematics and Computer Science (CWI).  ... 
fatcat:l27jrfiiubfptc4yl27n2543lu

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors

Neeldhara Misra, Frances Rosamond, Meirav Zehavi
2020 Algorithms  
This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity.  ...  Promising avenues and new research challenges are highlighted in this Special Issue.  ...  Its computation was also posed several times as a challenge in Parameterized Algorithms and Computational Experiments (PACE), an annual competition to design the fastest (in practice) algorithms for the  ... 
doi:10.3390/a13090236 fatcat:ptrl6x2yjzd57h7ctdgsfklsiq

Coupled online learning as a way to tackle instabilities and biases in neural network parameterizations: general algorithms and Lorenz 96 case study (v1.0)

Stephan Rasp
2020 Geoscientific Model Development  
Further, detailed algorithms for the implementation of coupled learning in 3D cloud-resolving models and the super parameterization framework are presented.  ...  Finally, outstanding challenges and issues not resolved by this approach are discussed.  ...  This work was supported by the German Research Foundation (DFG) and the Technical University of Munich (TUM) in the framework of the Open Access Publishing Program. Review statement.  ... 
doi:10.5194/gmd-13-2185-2020 fatcat:3unplpywjbb55gmrnevjjqhxei

Distributed Genetic Algorithm for Feature Selection in Gaia RVS Spectra: Application to ANN Parameterization [chapter]

Diego Fustes, Diego Ordóñez, Carlos Dafonte, Minia Manteiga, Bernardino Arcay
2012 Astrostatistics and Data Mining  
and the parameterization takes place through the learning of the artificial neural networks.  ...  The algorithm that demarcates the areas of the spectra sensitive to each atmospheric parameter (effective temperature and gravity, metallicity, and abundance of alpha elements) is a genetic algorithm,  ...  Even though that in general terms the obtained results are good, we believe that the challenge of parameterizing Gaia enormous data volume demands the use of highly efficient algorithms.  ... 
doi:10.1007/978-1-4614-3323-1_12 fatcat:y2ep2arxz5crhivmxnk5462qqm

Coupled online learning as a way to tackle instabilities and biases in neural network parameterizations [article]

Stephan Rasp
2019 arXiv   pre-print
Further, detailed algorithms for the implementation of coupled learning in 3D cloud-resolving models and the super parameterization framework are presented.  ...  Finally, outstanding challenges and issues not resolved by this approach are discussed.  ...  I thank Chris Bretherton, Noah Brenowitz, Tapio Schneider, Sebastian Scher, David John Gagne, Tom Beucler, Mike Pritchard and Pierre Gentine for their valuable input. I ac-  ... 
arXiv:1907.01351v3 fatcat:nvcmx2cmyncf3ia2mkzhqld3nu

Construction of groupwise consistent shape parameterizations by propagation

Matthias Kirschner, Stefan Wesarg, Benoit M. Dawant, David R. Haynor
2010 Medical Imaging 2010: Image Processing  
One of the greatest challenges in statistical shape modeling is to compute a representation of the training shapes as vectors of corresponding landmarks, which is required to train the model.  ...  Our algorithm firstly computes an area-preserving parameterization of a single reference shape, which is then propagated to all other shapes in the training set.  ...  Experiments In our first experiment, we selected for each data set an arbitrary reference mesh, for which we computed an areapreserving parameterization.  ... 
doi:10.1117/12.844349 dblp:conf/miip/KirschnerW10 fatcat:77nnrn7vk5fe7puyxsec5mpqma

On Ling's binomial and negative binomial distributions of order k

K. Hirano, S. Aki, N. Kashiwagi, H. Kuboki
1991 Statistics and Probability Letters  
If the response of the computer experiment is the complexity of the underlying algorithm then it is deterministic for a fixed input but may be taken as stochastic for fixed input size and randomly varying  ...  A computer experiment is a series of runs of a code for various inputs. A deterministic computer experiment is one which produces identical results if the code is re-run for identical inputs.  ...  We refer the reader to [13, 14] . See also [15] for a general overview on parameterized complexity.  ... 
doi:10.1016/0167-7152(91)90115-8 fatcat:o32i4xkbxbhb7os7pciduouoma

Parameter discovery for stochastic computational models in systems biology using Bayesian model checking

Faraz Hussain, Christopher J. Langmead, Qi Mi, Joyeeta Dutta-Moscato, Yoram Vodovotz, Sumit K. Jha
2014 2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)  
Parameterized probabilistic complex computational (P 2 C 2 ) models are being increasingly used in computational systems biology for analyzing biological systems.  ...  We demonstrate our algorithm by discovering the amount and schedule of doses of bacterial lipopolysaccharide in a clinical agent-based model of the dynamics of acute inflammation that guarantee a set of  ...  INTRODUCTION With rapid increase in the availability of high-performance computing, there has been a surge in interest in the construction of parameterized probabilistic complex computational (P 2 C 2  ... 
doi:10.1109/iccabs.2014.6863925 dblp:conf/iccabs/HussainLMDVJ14 fatcat:klj3qtidwnbfxaekrlllzdk7iq

Automatic Construction of Statistical Shape Models for Vertebrae [chapter]

Meike Becker, Matthias Kirschner, Simon Fuhrmann, Stefan Wesarg
2011 Lecture Notes in Computer Science  
Then every shape is cut along these loops and parameterized to a rectangle.  ...  One of the main challenges using SSMs is the solution of the correspondence problem. In this work we present a generic automated approach for solving the correspondence problem for vertebrae.  ...  Because the initial, uniform sampling grid defines a parameterization of M, and all points of M Adap lie on the surface of M, we can compute the parameter space coordinates of the points of M Adap by simple  ... 
doi:10.1007/978-3-642-23629-7_61 fatcat:eib3jvkfordjnejggqdl2rwwzu

Voting for Distortion Points in Geometric Processing

Shuangming Chai, Xiao-Ming Fu, Ligang Liu
2019 IEEE Transactions on Visualization and Computer Graphics  
parameterization; and (3) detect the distortion points.  ...  The distortion points generated by our method are utilized in three applications, including planar parameterization, semi-automatic landmark correspondence, and isotropic remeshing.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their constructive suggestions and comments.  ... 
doi:10.1109/tvcg.2019.2947420 pmid:31634132 fatcat:m2ii5c7d5ngapdk574yvj3i4pu

An End-to-End Differentiable Framework for Contact-Aware Robot Design [article]

Jie Xu, Tao Chen, Lara Zlokapa, Michael Foshey, Wojciech Matusik, Shinjiro Sueda, Pulkit Agrawal
2021 arXiv   pre-print
The two key components of this framework are: a novel deformation-based parameterization that allows for the design of articulated rigid robots with arbitrary, complex geometry, and a differentiable rigid  ...  body simulator that can handle contact-rich scenarios and computes analytical gradients for a full spectrum of kinematic and dynamic parameters.  ...  Toyota Research Institute (TRI), Defense Advanced Research Projects Agency (FA8750-20-C-0075), and the National Science Foundation (CAREER-1846368) provided funds to support this work.  ... 
arXiv:2107.07501v1 fatcat:cr3ww2eue5fvni6c7ldweariae

Parameterization of connectionist models

Rafal Bogacz, Jonathan D. Cohen
2004 Behavoir research methods, instruments & computers  
This report describes an algorithm for parameterization of connectionist models that seeks to address the challenges outlined above.  ...  First, the subplex optimization algorithm has a number of parameters (e.g., initial size of the simplex), which we chose on the basis of our experience.  ...  To access the above files or links, search the archive for this article using the journal (Behavior Research Methods, Instruments, & Computers) , the first author's name (Bogacz) and the publication year  ... 
doi:10.3758/bf03206554 pmid:15641419 fatcat:enu2vyc3orcntpgq2ddhnu3cye

Convergence and performance aspects of physics-dynamics coupling in US-Department of Energy research [article]

Dorothy Koch
2018 Figshare  
Convergence and performanceaspects of physics-dynamicscoupling in US-Department ofEnergy research  ...  Assessing and Improving the Numerical Solution of Atmospheric Physics in E3SM, Hui Wan The ChallengeParameterizations often use simple time stepping and long step sizes • Convergence can be significantly  ...  The Challenge • Improve the E3SM atmosphere model (EAM) performance through concurrent calculation of physics and dynamics.  ... 
doi:10.6084/m9.figshare.7111772.v1 fatcat:etwmuujtqbglxapz77dev5yz5u

Reinforcement Learning in Robotics: Applications and Real-World Challenges

Petar Kormushev, Sylvain Calinon, Darwin Caldwell
2013 Robotics  
We give a summary of the state-of-the-art of reinforcement learning in the context of robotics, in terms of both algorithms and policy representations.  ...  Numerous challenges faced by the policy representation in robotics are identified.  ...  Acknowledgments This work was partially supported by the AMARSi European project under contract FP7-ICT-248311, and by the PANDORA European project under contract FP7-ICT-288273.  ... 
doi:10.3390/robotics2030122 fatcat:na77gpncsjckrdhvqlwc4fxh2m

An Effective Approach to Pose Invariant 3D Face Recognition [chapter]

Dayong Wang, Steven C. H. Hoi, Ying He
2011 Lecture Notes in Computer Science  
We conducted a set of extensive experiments on both 2D and 3D face recognition, in which the encouraging results showed that the proposed scheme is more effective than the regular face recognition solutions  ...  One critical challenge encountered by existing face recognition techniques lies in the difficulties of handling varying poses.  ...  Acknowledgement The work was supported by the Singapore National Research Foundation Interactive Digital Media R&D Program, under research grant NRF2008IDM-IDM004-006.  ... 
doi:10.1007/978-3-642-17832-0_21 fatcat:3ybpw6ocmjavlhff3sezf5zxoy
« Previous Showing results 1 — 15 out of 101,061 results