Sciweavers

635 search results - page 56 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
IEEEPACT
1998
IEEE
15 years 1 months ago
Scanning Polyhedra without Do-loops
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
Pierre Boulet, Paul Feautrier
GROUP
1993
ACM
15 years 1 months ago
Development of multiple media documents
: Development of documents in multiple media involves activities in three different fields, the technical, the discoursive and the procedural. The major development problems of art...
Stephen J. Morris, Anthony Finkelstein
DEBS
2007
ACM
15 years 1 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
IGPL
2006
107views more  IGPL 2006»
14 years 9 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
COLING
2010
14 years 4 months ago
A Multiple-Domain Ontology Builder
The interpretation of a multiple-domain text corpus as a single ontology leads to misconceptions. This is because some concepts may be syntactically equal; though, they are semant...
Sara Salem, Samir AbdelRahman