450 search results - page 69 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
APWEB
2004
Springer
15 years 5 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
108
click to vote
NIPS
2004
15 years 1 months ago
2004
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
WSC
2004
15 years 1 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
261
click to vote
PAMI
2010
14 years 10 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...