534 search results - page 66 / 107 » Efficient polynomial L-approximations |
167
click to vote
AI
2002
Springer
15 years 5 months ago
2002
Springer
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
141
click to vote
CAGD
2002
15 years 5 months ago
2002
This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, whe...
188
click to vote
DAM
1999
15 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
189
click to vote
JAIR
2010
15 years 22 days ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
158
click to vote
MST
2010
15 years 21 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...