564 search results - page 96 / 113 » Approximation algorithms for restricted Bayesian network str... |
131
click to vote
KAIS
2011
14 years 7 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
93
Voted
SIGMOD
2001
ACM
16 years 19 days ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
FLAIRS
2004
15 years 1 months ago
2004
The Heavy Weight Deflectometer (HWD) test is one of the most widely used tests for assessing the structural integrity of airport pavements in a non-destructive manner. The elastic...
116
Voted
SIAMDM
2010
14 years 7 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...