Sciweavers

3897 search results - page 161 / 780
» complexity 2010
Sort
View
98
Voted
EDBT
2010
ACM
137views Database» more  EDBT 2010»
15 years 5 months ago
Fine-grained and efficient lineage querying of collection-based workflow provenance
The management and querying of workflow provenance data underpins a collection of activities, including the analysis of workflow results, and the debugging of workflows or service...
Paolo Missier, Norman W. Paton, Khalid Belhajjame
120
Voted
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 9 months ago
Enumerating randoms
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
PROCEDIA
2010
119views more  PROCEDIA 2010»
15 years 26 days ago
Performance and accuracy of Lattice-Boltzmann kernels on multi- and manycore architectures
We present different kernels based on Lattice-Boltzmann methods for the solution of the twodimensional Shallow Water and Navier-Stokes equations on fully structured lattices. The...
Dirk Ribbrock, Markus Geveler, Dominik Göddek...
MST
2010
105views more  MST 2010»
15 years 27 days ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
AAAI
2010
15 years 3 months ago
Possible Winners when New Candidates Are Added: The Case of Scoring Rules
In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winner...
Yann Chevaleyre, Jérôme Lang, Nicolas...