Sciweavers

16725 search results - page 3138 / 3345
» Engineering Software Correctness
Sort
View
FSTTCS
2004
Springer
15 years 9 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
FSTTCS
2004
Springer
15 years 9 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
FSTTCS
2004
Springer
15 years 9 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
FSTTCS
2004
Springer
15 years 9 months ago
Adaptive Stabilization of Reactive Protocols
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...
Shay Kutten, Boaz Patt-Shamir
GG
2004
Springer
15 years 9 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
« Prev « First page 3138 / 3345 Last » Next »