5356 search results - page 120 / 1072 » Adventures in time and space |
404
click to vote
ICDE
2000
IEEE
16 years 7 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...
190
click to vote
DAGSTUHL
2003
15 years 7 months ago
2003
Many systems require the setting of a large number of parameters. This is often a difficult and time consuming task, especially for novice users. A framework is presented to simp...
153
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
218
click to vote
TEC
2002
15 years 6 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
159
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
We propose a new and powerful tool for the analysis of trajectories, which in particular allows for more temporally aware analyses. Time plays an important role in the analysis of ...