Sciweavers

3678 search results - page 31 / 736
» On the Stable Paths Problem
Sort
View

Publication
2630views
15 years 9 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
BMCBI
2010
74views more  BMCBI 2010»
13 years 10 months ago
Correcting for the effects of natural abundance in stable isotope resolved metabolomics experiments involving ultra-high resolut
Background: Stable isotope tracing with ultra-high resolution Fourier transform-ion cyclotron resonance-mass spectrometry (FT-ICR-MS) can provide simultaneous determination of hun...
Hunter N. B. Moseley
NIPS
2007
13 years 11 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 1 months ago
Sparse approximation property and stable recovery of sparse signals from noisy measurements
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...
Qiyu Sun
COMPGEOM
2010
ACM
14 years 3 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...