Sciweavers

4581 search results - page 260 / 917
» Computing Transformation Semigroups
Sort
View
LPNMR
2007
Springer
16 years 23 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
VISUALIZATION
2003
IEEE
15 years 12 months ago
Accelerating Large Data Analysis by Exploiting Regularities
We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (al...
David Ellsworth, Patrick J. Moran
POPL
2003
ACM
15 years 12 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke
ECMDAFA
2009
Springer
119views Hardware» more  ECMDAFA 2009»
15 years 4 months ago
Managing Model Adaptation by Precise Detection of Metamodel Changes
Technological and business changes influence the evolution of software systems. When this happens, the software artifacts may need to be adapted to the changes. This need is rapidl...
Kelly Garcés, Frédéric Jouaul...
CVPR
1996
IEEE
16 years 8 months ago
Canonical Decomposition of Steerable Functions
This paper presents a general formulation enabling determination of all functions that are steerable under any transformation group. These steerable functions are determinedunique...
Yacov Hel-Or, Patrick C. Teo