Sciweavers

455 search results - page 32 / 91
» Dynamic well-spaced point sets
Sort
View
TALG
2008
131views more  TALG 2008»
15 years 4 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
ICIP
2005
IEEE
16 years 6 months ago
Shape space sampling distributions and their impact on visual tracking
Object motions can be represented as a sequence of shape deformations and translations which can be interpretated as a sequence of points in N-dimensional shape space. These space...
Amit Kale, Christopher O. Jaynes
CEC
2008
IEEE
15 years 10 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
ASPLOS
2008
ACM
15 years 6 months ago
Improving the performance of object-oriented languages with dynamic predication of indirect jumps
Indirect jump instructions are used to implement increasinglycommon programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls...
José A. Joao, Onur Mutlu, Hyesoon Kim, Rish...