Sciweavers

7303 search results - page 1360 / 1461
» Optimality for dynamic patterns
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 3 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
RSS
2007
135views Robotics» more  RSS 2007»
15 years 3 months ago
Learning omnidirectional path following using dimensionality reduction
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
J. Zico Kolter, Andrew Y. Ng
UAI
1997
15 years 3 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
APVIS
2009
15 years 2 months ago
Visualizing time-varying features with TAC-based distance fields
To analyze time-varying data sets, tracking features over time is often necessary to better understand the dynamic nature of the underlying physical process. Tracking 3D time-vary...
Teng-Yok Lee, Han-Wei Shen
ICECCS
2010
IEEE
162views Hardware» more  ICECCS 2010»
15 years 1 months ago
Trust-Based Adaptation in Complex Service-Oriented Systems
Abstract—Complex networks consisting of humans and software services, such as Web-based social and collaborative environments, typically require flexible and context-based inter...
Florian Skopik, Daniel Schall, Schahram Dustdar
« Prev « First page 1360 / 1461 Last » Next »