Location Modeling Utilizing Maximum Service Distance Criteria

Location-Aware Web Service by Utilizing Web Contents Including Location Information

Traditional search engines are usually based on keyword-based retrievals, where location information is simply treated as text data, thus resulting in incorrect search results and low degree of user satisfaction. In this paper, we propose a location-aware Web Service system, which adds location information to web contents, usually consisting of text and multimedia information. For this purpose,...

Improving n-gram modeling using distance-related unit association maximum entropy language modeling

In this paper, a distance-related unit association maximum entropy (DUAME) language modeling is proposed. This approach can model an event (unit subsequence) using the co-occurrence of full distance unit association (UA) features so that it is able to pursue a functional approximation to higher order N-gram with signi cantly less memory requirement. A smoothing strategy related to this modeling...

Ambulance Location for Maximum Survival

The Maximum Facility Location Problem

In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...

Maximum-Cover Source-Location Problems

Given a graph G = (V, E), a set of vertices S ⊆ V covers v ∈ V if the edge connectivity between S and v is at least a given number k. Vertices in S are called sources. The source location problem is a problem of finding a minimum-size source set covering all vertices of a given graph. This paper presents a new variation of the problem, called maximum-cover source-location problem, which finds a...