IPL
2008
13 years 7 months ago
2008
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
IPL
2008
13 years 7 months ago
2008
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
IPL
2008
13 years 7 months ago
2008
IPL
2008
13 years 7 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
IPL
2008
13 years 7 months ago
2008
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...
IPL
2008
13 years 7 months ago
2008
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
IPL
2008
13 years 7 months ago
2008
IPL
2008
13 years 7 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
IPL
2008
13 years 7 months ago
2008
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,...
IPL
2008
13 years 7 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...