Sciweavers

140 search results - page 10 / 28
» ipl 2008
Sort
View
IPL
2007
60views more  IPL 2007»
14 years 10 months ago
Robustness of PSPACE-complete sets
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
Aduri Pavan, Fengming Wang
IPL
2007
71views more  IPL 2007»
14 years 10 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy
IPL
2007
104views more  IPL 2007»
14 years 10 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
IPL
2008
172views more  IPL 2008»
14 years 10 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler
IPL
2008
114views more  IPL 2008»
14 years 10 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur