4843 search results - page 422 / 969 » The Shortcut Problem - Complexity and Approximation |
296
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
222
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
189
click to vote
SSD
2005
Springer
16 years 8 days ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
169
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
165
click to vote
WAOA
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...