Sciweavers

64 search results - page 2 / 13
» The Ackermann Award 2009
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 days ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
TOG
2012
234views Communications» more  TOG 2012»
11 years 8 months ago
Fast automatic skinning transformations
Algebra I, II Complex Variables I, II Analysis I, II Awards, Scholarships, Fellowships Received • Back Cover Image, Proceedings of ACM SIGGRAPH, 2011 • New York University Henr...
Alec Jacobson, Ilya Baran, Ladislav Kavan, Jovan P...
RTA
2009
Springer
14 years 3 days ago
The Derivational Complexity Induced by the Dependency Pair Method
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
Georg Moser, Andreas Schnabl
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 6 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
GI
2009
Springer
13 years 10 months ago
Massively-Parallel Simulation of Biochemical Systems
: Understanding biological evolution prompts for a detailed understanding of the realized phenotype. Biochemical and gene regulatory dynamics are a cornerstone for the physiology o...
Jens Ackermann, Paul Baecher, Thorsten Franzel, Mi...