5169 search results - page 146 / 1034 » Locality approximation using time |
138
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
142
Voted
WAW
2007
Springer
15 years 11 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
159
click to vote
ECOOP
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. This paper presents a framework of specification and verification for distributed real-time object-oriented systems. An earlier paper [17] introduced a process calculus...
174
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
267
Voted
ICDE
1999
IEEE
16 years 6 months ago
1999
IEEE
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...