Sciweavers

2597 search results - page 268 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
RECOMB
2004
Springer
16 years 2 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 2 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ICALP
2009
Springer
16 years 2 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
PODS
2005
ACM
127views Database» more  PODS 2005»
16 years 2 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
CVPR
2010
IEEE
15 years 9 months ago
Rapid Selection of Reliable Templates for Visual Tracking
We propose a method that rates the suitability of given templates for template-based tracking in real-time. This is important for applications with online template selection, such...
Nicolas Alt, Stefan Hinterstoisser, Nassir Navab