Sciweavers

1933 search results - page 191 / 387
» High-performance computing using accelerators
Sort
View
NETWORKS
2008
13 years 10 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
IEEEPACT
2009
IEEE
13 years 8 months ago
Algorithmic Skeletons within an Embedded Domain Specific Language for the CELL Processor
Efficiently using the hardware capabilities of the Cell processor, a heterogeneous chip multiprocessor that uses several levels of parallelism to deliver high performance, and bei...
Tarik Saidani, Joel Falcou, Claude Tadonki, Lionel...
ICIP
2009
IEEE
13 years 8 months ago
Efficient reduction of support vectors in kernel-based methods
Kernel-based methods, e.g., support vector machine (SVM), produce high classification performances. However, the computation becomes time-consuming as the number of the vectors su...
Takumi Kobayashi, Nobuyuki Otsu
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
14 years 4 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
ACCV
2006
Springer
14 years 4 months ago
Fast Approximated SIFT
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
Michael Grabner, Helmut Grabner, Horst Bischof