Sciweavers

1677 search results - page 56 / 336
» On the Completeness of Quantum Computation Models
Sort
View
IJCNN
2007
IEEE
15 years 7 months ago
Self-Organizing Maps as Traveling Computational Templates
In this article we approach neural networks as computational templates that travel across various sciences. Traditionally, it has been thought that models are primarily models of s...
Tarja Knuuttila, Anna-Mari Rusanen, Timo Honkela
LICS
2009
IEEE
15 years 8 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 ...
CGF
2006
196views more  CGF 2006»
15 years 1 months ago
Physically Based Deformable Models in Computer Graphics
Physically based deformable models have been widely embraced by the Computer Graphics community. Many problems outlined in a previous survey by Gibson and Mirtich [GM97] have been...
Andrew Nealen, Matthias Müller, Richard Keise...
CCGRID
2007
IEEE
15 years 7 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 3 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich