Sciweavers

6004 search results - page 94 / 1201
» Parallelizing query optimization
Sort
View
SSD
2001
Springer
119views Database» more  SSD 2001»
14 years 2 months ago
Constrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agr...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 10 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
IPPS
1999
IEEE
14 years 2 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
RANDOM
1999
Springer
14 years 2 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
14 years 3 months ago
Sub-operation parallelism optimization in SIMD processor synthesis and its experimental evaluations
Abstract— In this paper, we propose a sub-operation parallelism optimization algorithm in SIMD processor synthesis. Given an initial assembly code and timing constraints, our alg...
Nozomu Togawa, Hideki Kawazu, Jumpei Uchida, Yuich...