Sciweavers

3223 search results - page 340 / 645
» The Scaling of Search Cost
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 11 months ago
Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
Davood Rafiei, Alberto O. Mendelzon
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 10 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
ICCV
1995
IEEE
15 years 10 months ago
Locating Objects Using the Hausdorff Distance
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
William Rucklidge
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
ICWS
2008
IEEE
15 years 8 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan