3708 search results - page 123 / 742 » Approximating Betweenness Centrality |
107
click to vote
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
143
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
124
click to vote
SIAMCOMP
1998
15 years 11 days ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
223
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
128
click to vote
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...