1632 search results - page 251 / 327 » Sublinear Time Algorithms for Metric Space Problems |
152
Voted
SODA
1993
ACM
15 years 5 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
135
Voted
AAAI
1998
15 years 5 months ago
1998
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
122
Voted
MP
2006
15 years 3 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
155
Voted
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
301
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...