818 search results - page 28 / 164 » Network bargaining: algorithms and structural results |
119
click to vote
AMAI
1999
Springer
15 years 1 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
140
Voted
IJBRA
2010
15 years 12 days ago
2010
—Accumulating evidence suggests that biological systems exhibit modular organization. Accurate identification of modularity is vital for understanding this organization. A recen...
100
click to vote
IAT
2007
IEEE
15 years 8 months ago
2007
IEEE
Collaborative tagging systems are becoming very popular recently. Web users use freely-chosen tags to describe shared resources, resulting in a folksonomy. One problem of folksono...
UAI
2003
15 years 3 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
107
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...