95 search results - page 13 / 19 » Graph summarization with bounded error |
NAACL
2010
13 years 5 months ago
2010
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
SSDBM
2003
IEEE
14 years 22 days ago
2003
IEEE
Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional support...
CN
2007
13 years 7 months ago
2007
Point-to-point delay is an important network performance measure as it captures service degradations caused by various events. We study how to measure and report delay in a concis...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...