Sciweavers

87 search results - page 3 / 18
» Efficient Multidimensional Searching Routines
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
ICDE
2000
IEEE
82views Database» more  ICDE 2000»
14 years 8 months ago
Similarity Search for Multidimensional Data Sequences
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Ho...
TSMC
2010
13 years 1 months ago
Fractional Particle Swarm Optimization in Multidimensional Search Space
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, M...
IPPS
1998
IEEE
13 years 11 months ago
Improved Concurrency Control Techniques For Multi-Dimensional Index Structures
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
Kothuri Venkata Ravi Kanth, David Serena, Ambuj K....
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
13 years 11 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan