Sciweavers

5316 search results - page 223 / 1064
» Which Search Problems Are Random
Sort
View
124
Voted
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 5 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
GEOS
2005
Springer
15 years 10 months ago
Ontology Matching for Spatial Data Retrieval from Internet Portals
This paper analyses reported difficulties in spatial data retrieval from Internet portals, based on results from an empirical survey. The analysis reveals the problems which cause ...
Hartwig H. Hochmair
ICIAR
2004
Springer
15 years 10 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
ISAAC
1999
Springer
70views Algorithms» more  ISAAC 1999»
15 years 8 months ago
Multiple Spin-Block Decisions
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
Peter Damaschke
LSGRID
2004
Springer
15 years 10 months ago
Mega Process Genetic Algorithm Using Grid MP
In this study, a new Genetic Algorithm (GA) using the Tabu · Local Search mechanism is proposed. The GA described in this paper is considered a Mega Process GA, which has an effe...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki,...