- Full text PDF available (4)
- This year (0)
- Last 5 years (2)
- Last 10 years (6)
Journals and Conferences
We study the problem of resolving a perhaps misspelled address of a location into geographic coordinates of latitude and longitude. Our data structure solves this problem within a few milliseconds even for misspelled and fragmentary queries. Compared to major geographic search engines such as Google or Bing we achieve results of significantly better quality.
In a review article, the basic principles of special education and therapies for children with developmental disabilities are discussed. Physiotherapy, occupational therapy, speech therapy and psychomotor therapy are the most widely used treatment methods. In addition there are many preschool programs of special schools. The essence of all these activities… (More)
We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words W, maximum distance d fixed at preprocessing time and a query word q, we would like to retrieve all words from W that can be transformed into q with d or less edit operations. We present data structures that support fault tolerant queries by generating an… (More)
We study the problem of resolving a perhaps misspelled address of a location into geographic coordinates of latitude and longitude. Our solution does not require any prefixed rule set and is able to recover even heavily misspelled and fragmentary queries within a few milliseconds.
Padberg  introduced a geometric notion of ranks for (mixed) integer rational polyhedrons and conjectured that the geometric rank of the matching polytope is one. In this work, we prove that this conjecture is true. 1 Preliminaries Padberg  defined the notion of geometric ranks for the facets of the polytopes. All definitions provided in this section… (More)