316 search results - page 11 / 64 » On Approximate Majority and Probabilistic Time |
ICML
2009
IEEE
15 years 10 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 ...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
DFG
2009
Springer
15 years 4 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
126
click to vote
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
AIPS
2009
14 years 10 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...