Sciweavers

550 search results - page 25 / 110
» Inherently Parallel Geometric Computations
Sort
View
ICPP
2009
IEEE
13 years 7 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
CF
2007
ACM
14 years 1 months ago
Converting massive TLP to DLP: a special-purpose processor for molecular orbital computations
We propose an application specific processor for computational quantum chemistry. The kernel of interest is the computation of electron repulsion integrals (ERIs), which vary in c...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
IPPS
1998
IEEE
14 years 2 months ago
A Configurable Computing Approach Towards Real-Time Target Tracking
Traditionally, tracking systems require dedicated hardware to handle the computational demands and input/output rates imposed by real-time video sources. An alternative presented i...
Bharadwaj Pudipeddi, A. Lynn Abbott, Peter M. Atha...
CIARP
2004
Springer
14 years 3 months ago
Parallel Algorithm for Extended Star Clustering
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...
Reynaldo Gil-García, José Manuel Bad...
ICCV
2005
IEEE
14 years 11 months ago
Realtime IBR with Omnidirectional Crossed-Slits Projection
The Crossed-Slits (X-Slits) projection can be used to generate new views of a scene from a sequence of perspective images. Compared with other image-based rendering (IBR) techniqu...
Doron Feldman, Daphna Weinshall