2373 search results - page 175 / 475 » Complexities for generalized models of self-assembly |
203
click to vote
NAACL
2010
15 years 4 months ago
2010
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
159
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
172
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
We present an approach for efficiently recognizing all objects in a scene and estimating their full pose from multiple views. Our approach builds upon a state of the art single-vie...
197
click to vote
APN
1992
Springer
15 years 10 months ago
1992
Springer
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
178
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...