324 search results - page 37 / 65 » Distance Approximating Trees: Complexity and Algorithms |
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
COCO
2003
Springer
14 years 19 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
WINE
2005
Springer
14 years 27 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...