2766 search results - page 406 / 554 » Algorithms for trigonometric polynomials |
137
click to vote
AI
2002
Springer
15 years 4 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...
151
Voted
ACTA
2000
15 years 4 months ago
2000
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
125
click to vote
MST
2007
15 years 3 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
124
click to vote
ATMOS
2010
15 years 3 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
149
Voted
JUCS
2010
15 years 2 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...