Sciweavers

8496 search results - page 297 / 1700
» Problem Solving and Complex Systems
Sort
View
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
15 years 6 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
GLOBECOM
2006
IEEE
16 years 21 days ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
CASES
2009
ACM
15 years 4 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
16 years 22 days ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
16 years 1 months ago
Clustering Events on Streams Using Complex Context Information
Monitoring applications play an increasingly important role in many domains. They detect events in monitored systems and take actions such as invoke a program or notify an adminis...
YongChul Kwon, Wing Yee Lee, Magdalena Balazinska,...