Sciweavers

1670 search results - page 94 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 9 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ICPR
2002
IEEE
15 years 8 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho
INTEGRATION
2007
100views more  INTEGRATION 2007»
15 years 2 months ago
A fast pipelined multi-mode DES architecture operating in IP representation
The Data Encryption Standard (DES) is a cipher that is still used in a broad range of applications, from smartcards, where it is often implemented as a tamperresistant embedded co...
Sylvain Guilley, Philippe Hoogvorst, Renaud Pacale...
WACV
2008
IEEE
15 years 9 months ago
Robust Human Pose Recognition Using Unlabelled Markers
In this paper, we tackle robust human pose recognition using unlabelled markers obtained from an optical marker-based motion capture system. A coarse-to-fine fast pose matching al...
Yi Wang, Gang Qian