Sciweavers

2297 search results - page 75 / 460
» A fast APRIORI implementation
Sort
View
75
Voted
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 4 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan
FGR
2002
IEEE
151views Biometrics» more  FGR 2002»
15 years 3 months ago
Fast Stereo-Based Head Tracking for Interactive Environments
We present a robust implementation of stereo-based head tracking designed for interactive environments with uncontrolled lighting. We integrate fast face detection and drift reduc...
Louis-Philippe Morency, Ali Rahimi, Neal Checka, T...
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 11 months ago
Fast Maximum-Likelihood Decoding of the Golden Code
Because each golden code codeword conveys four information symbols from an -ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to 4 . In this paper we...
Mohanned O. Sinnokrot, John R. Barry
86
Voted
MVA
1998
110views Computer Vision» more  MVA 1998»
14 years 10 months ago
A fast algorithm for detecting die extrusion defects in IC packages
In this paper, we present a fast method for the detection of die extrusion defects in IC packages. The optical and lighting set-up as well as the details of the algorithm used for ...
H. Zhou, Ashraf A. Kassim, S. Ranganath
ICASSP
2011
IEEE
14 years 2 months ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche