Sciweavers

1172 search results - page 185 / 235
» Path Algorithms on Regular Graphs
Sort
View
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
14 years 11 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
CORR
2010
Springer
236views Education» more  CORR 2010»
14 years 8 months ago
Precise, Scalable and Online Request Tracing for Multi-tier Services of Black Boxes
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
Bo Sang, Jianfeng Zhan, Zhihong Zhang, Lei Wang, D...
ICCV
1999
IEEE
16 years 3 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 8 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
15 years 7 months ago
Partial Elastic Matching of Time Series
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...