Sciweavers

490 search results - page 60 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
IEEEPACT
2006
IEEE
14 years 2 months ago
Testing implementations of transactional memory
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
Chaiyasit Manovit, Sudheendra Hangal, Hassan Chafi...
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
CVPR
2009
IEEE
15 years 4 months ago
Let the Kernel Figure it Out; Principled Learning of Pre-processing for Kernel Classifiers
Most modern computer vision systems for high-level tasks, such as image classification, object recognition and segmentation, are based on learning algorithms that are able to se...
Peter V. Gehler, Sebastian Nowozin
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
ICPR
2008
IEEE
14 years 10 months ago
SVD based Kalman particle filter for robust visual tracking
Object tracking is one of the most important tasks in computer vision. The unscented particle filter algorithm has been extensively used to tackle this problem and achieved a grea...
Qingdi Wei, Weiming Hu, Xi Li, Xiaoqin Zhang, Yang...