268 search results - page 39 / 54 » Growing Protean Graphs |
124
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
153
click to vote
MST
2010
14 years 8 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
126
click to vote
FUIN
2008
15 years 1 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
118
click to vote
JMLR
2008
15 years 1 months ago
2008
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
108
click to vote
JWSR
2007
15 years 1 months ago
2007
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...