Sciweavers

16626 search results - page 202 / 3326
» Computing is a natural science
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
NC
2006
132views Neural Networks» more  NC 2006»
15 years 6 months ago
Learning short multivariate time series models through evolutionary and sparse matrix computation
Multivariate Time Series (MTS) data are widely available in different fields including medicine, finance, bioinformatics, science and engineering. Modelling MTS data accurately is...
Stephen Swift, Joost N. Kok, Xiaohui Liu
LICS
2009
IEEE
16 years 1 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
IJBC
2008
112views more  IJBC 2008»
15 years 6 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...
GI
2009
Springer
15 years 4 months ago
The B-Fabric Life Sciences Data Management System
Can Türker, Dieter Joho, Fuat Akal, Christian...