Sciweavers

1508 search results - page 54 / 302
» Efficient Path Profiling
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 12 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
TSMC
2002
110views more  TSMC 2002»
14 years 11 months ago
Bio-mimetic trajectory generation of robots via artificial potential field with time base generator
This paper proposes a new trajectory generation method that allows full control of transient behavior, namely, time-to-target and velocity profile, based on the artificial potentia...
Toshio Tsuji, Yoshiyuki Tanaka, Pietro Morasso, Vi...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 1 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
ECCV
2004
Springer
15 years 3 months ago
Efficient Initialization for Constrained Active Surfaces, Applications in 3D Medical Images
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through si...
Roberto Ardon, Laurent D. Cohen
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 4 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu