Sciweavers

5350 search results - page 196 / 1070
» Space and time in eco-ontologies
Sort
View
CCCG
2003
15 years 8 months ago
Computing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 11 months ago
BBOB-benchmarking the DIRECT global optimization algorithm
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during ...
Petr Posik
ALGORITHMICA
2010
75views more  ALGORITHMICA 2010»
15 years 6 months ago
In-Place Algorithms for Computing (Layers of) Maxima
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
Henrik Blunck, Jan Vahrenhold
ADBIS
2006
Springer
181views Database» more  ADBIS 2006»
16 years 16 days ago
Searching for Similar Trajectories on Road Networks Using Spatio-temporal Similarity
In order to search similar moving object trajectories, the previously used methods focused on Euclidean distance and considered only spatial similarity. Euclidean distance is not a...
Jung-Rae Hwang, Hye-Young Kang, Ki-Joune Li
IADIS
2004
15 years 8 months ago
Relevant information retrieval for cooperative Web architecture
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
Aki Kobayashi, Kuangmin Tan, Katsunori Yamaoka, Yo...