2125 search results - page 261 / 425 » On Graph Complexity |
141
click to vote
AI
2002
Springer
15 years 2 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
139
Voted
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
123
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
245
click to vote
ICSE
2009
IEEE-ACM
15 years 18 days ago
2009
IEEE-ACM
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
124
click to vote
IPSN
2009
Springer
15 years 9 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...