324 search results - page 43 / 65 » Distance Approximating Trees: Complexity and Algorithms |
128
Voted
JACM
2000
15 years 3 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
160
Voted
NETWORKING
2007
15 years 4 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
162
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
115
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
128
Voted
NIPS
1997
15 years 4 months ago
1997
A new algorithm is presented which approximates the perceived visual similarity between images. The images are initially transformed into a feature space which captures visual str...