1091 search results - page 85 / 219 » Approximation Algorithms for Data Placement Problems |
185
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
145
Voted
STOC
2005
ACM
15 years 8 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
162
Voted
JMLR
2012
13 years 5 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
254
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
120
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...