Sciweavers

667 search results - page 124 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
CIKM
2006
Springer
13 years 10 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
DAGSTUHL
2007
13 years 8 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
CPAIOR
2009
Springer
14 years 1 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
GIS
2003
ACM
13 years 12 months ago
Construction of the planar partition postal code map based on cadastral reGIStration
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
Friso Penninga, Edward Verbree, Wilko Quak, Peter ...
COMPGEOM
2009
ACM
14 years 1 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan