Sciweavers

13603 search results - page 32 / 2721
» On the Complexity of Computing Treelength
Sort
View
ACL
2010
13 years 7 months ago
Complexity Metrics in an Incremental Right-Corner Parser
Hierarchical HMM (HHMM) parsers make promising cognitive models: while they use a bounded model of working memory and pursue incremental hypotheses in parallel, they still achieve...
Stephen Wu, Asaf Bachrach, Carlos Cardenas, Willia...
CSCW
2012
ACM
12 years 4 months ago
CrowdWeaver: visually managing complex crowd work
Though toolkits exist to create complex crowdsourced workflows, there is limited support for management of those workflows. Managing crowd workers and tasks requires significant i...
Aniket Kittur, Susheel Khamkar, Paul André,...
ICDE
2012
IEEE
273views Database» more  ICDE 2012»
11 years 11 months ago
Data3 - A Kinect Interface for OLAP Using Complex Event Processing
—Motion sensing input devices like Microsoft’s Kinect offer an alternative to traditional computer input devices like keyboards and mouses. Daily new applications using this in...
Steffen Hirte, Andreas Seifert, Stephan Baumann, D...
TOG
2002
162views more  TOG 2002»
13 years 8 months ago
Animation and rendering of complex water surfaces
We present a new method for the animation and rendering of photorealistic water effects. Our method is designed to produce visually plausible three dimensional effects, for exampl...
Douglas Enright, Stephen R. Marschner, Ronald Fedk...
WG
2010
Springer
13 years 7 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter