681 search results - page 66 / 137 » General Polynomial Time Decomposition Algorithms |
92
Voted
JMLR
2010
14 years 7 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
119
Voted
DAM
2008
15 years 16 days ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
101
Voted
CADE
2006
Springer
16 years 23 days ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
85
Voted
DAC
2009
ACM
15 years 7 months ago
2009
ACM
In this paper we present a continuous surface model to describe the interconnect geometric variation, which improves the currently used model for better accuracy while not increas...
125
click to vote
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...