Sciweavers

4539 search results - page 72 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CGI
2004
IEEE
15 years 1 months ago
A Versatile and Robust Model for Geometrically Complex Deformable Solids
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
WETICE
1998
IEEE
15 years 2 months ago
Questionnaires: A Framework using Mobile Code for Component-Based Tele-Exams
Applications for computer supported cooperative work can gain from component models and frameworks. The framework for "questionnaires", which is described in this paper,...
Jakob Hummes, Arnd Kohrs, Bernard Mérialdo
ICASSP
2009
IEEE
15 years 4 months ago
Fast noise PSD estimation with low complexity
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
COLING
1992
14 years 11 months ago
On the Satisfiability of Complex Constraints
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
Luís Damas, Giovanni B. Varile
VMCAI
2005
Springer
15 years 3 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan