Sciweavers

3937 search results - page 485 / 788
» Questioning Ubiquitous Computing
Sort
View
LICS
2007
IEEE
16 years 27 days ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
16 years 24 days ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
FCT
2007
Springer
16 years 24 days ago
A String-Based Model for Simple Gene Assembly
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Robert Brijder, Miika Langille, Ion Petre
ICSOC
2007
Springer
16 years 23 days ago
Deriving SOA Evaluation Metrics in an Enterprise Architecture Context
Abstract. Service oriented architectures (SOA) are becoming reality in a corporate environment. Rather than pure technology improvements SOA intends to increase manageability and s...
Stephan Aier, Maximilian Ahrens, Matthias Stutz, U...
SCALESPACE
2007
Springer
16 years 22 days ago
Combining Curvature Motion and Edge-Preserving Denoising
Abstract. In this paper we investigate a family of partial di erential equations (PDEs) for image processing which can be regarded as isotropic nonlinear di usion with an additiona...
Stephan Didas, Joachim Weickert