2254 search results - page 140 / 451 » Computing the minimal covering set |
194
click to vote
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
115
click to vote
WEBDB
2007
Springer
15 years 7 months ago
2007
Springer
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
ADBIS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. One of the areas of data integration covers systems that maintain coherence among a heterogeneous set of databases. Such a system repeatedly collects data from the local ...
121
click to vote
JELIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...