Sciweavers

1518 search results - page 50 / 304
» Exact and Approximate Bandwidth
Sort
View
CAD
2007
Springer
14 years 9 months ago
Error analysis of reparametrization based approaches for curve offsetting
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
Hong-Yan Zhao, Guo-Jin Wang
ESSMAC
2003
Springer
15 years 2 months ago
Simultaneous Localization and Surveying with Multiple Agents
We apply a constrained Hidden Markov Model architecture to the problem of simultaneous localization and surveying from sensor logs of mobile agents navigating in unknown environmen...
Sam T. Roweis, Ruslan Salakhutdinov
AAAI
2006
14 years 11 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
NECO
2008
112views more  NECO 2008»
14 years 9 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 1 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann