564 search results - page 71 / 113 » Approximation algorithms for restricted Bayesian network str... |
110
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
126
Voted
ECML
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
109
Voted
NGC
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
95
Voted
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...