Sciweavers

2714 search results - page 118 / 543
» Approximation Schemes for Scheduling
Sort
View
92
Voted
SCALESPACE
2005
Springer
15 years 6 months ago
Stabilised Nonlinear Inverse Diffusion for Approximating Hyperbolic PDEs
Stabilised backward diffusion processes have shown their use for a number of image enhancement tasks. The goal of this paper is to show that they are also highly useful for designi...
Michael Breuß, Thomas Brox, Thomas Sonar, Jo...
113
Voted
SOSP
2007
ACM
15 years 9 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
DATE
2000
IEEE
119views Hardware» more  DATE 2000»
15 years 5 months ago
Bus Access Optimization for Distributed Embedded Systems Based on Schedulability Analysis
We present an approach to bus access optimization and schedulability analysis for the synthesis of hard real-time distributed embedded systems. The communication model is based on...
Paul Pop, Petru Eles, Zebo Peng
93
Voted
COCOON
2005
Springer
15 years 6 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 5 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates