1957 search results - page 152 / 392 » Approximate algorithms for neural-Bayesian approaches |
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
ICRA
1998
IEEE
15 years 2 months ago
1998
IEEE
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
AAAI
2007
15 years 9 days ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
103
click to vote
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
RECOMB
2010
Springer
14 years 11 months ago
2010
Springer
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...