1887 search results - page 34 / 378 » An efficient search algorithm for partially ordered sets |
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Zebra-crossings are useful road features for outdoor navigation in mobility aids for the partially sighted. In this paper, zebra-crossings are detected by looking for groups of co...
ESCIENCE
2007
IEEE
13 years 11 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...