Sciweavers

264 search results - page 44 / 53
» On the possibility of faster SAT algorithms
Sort
View
CIKM
1997
Springer
15 years 2 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
DAC
2007
ACM
15 years 2 months ago
A Probabilistic Approach to Model Resource Contention for Performance Estimation of Multi-featured Media Devices
The number of features that are supported in modern multimedia devices is increasing faster than ever. Estimating the performance of such applications when they are running on sha...
Akash Kumar, Bart Mesman, Henk Corporaal, Bart D. ...
93
Voted
AUSAI
2006
Springer
15 years 1 days ago
An Efficient Alternative to SVM Based Recursive Feature Elimination with Applications in Natural Language Processing and Bioinfo
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it wa...
Justin Bedo, Conrad Sanderson, Adam Kowalczyk
FIMI
2003
95views Data Mining» more  FIMI 2003»
14 years 11 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
TVLSI
2010
14 years 4 months ago
Computation Error Analysis in Digital Signal Processing Systems With Overscaled Supply Voltage
It has been recently demonstrated that digital signal processing systems may possibly leverage unconventional voltage overscaling (VOS) to reduce energy consumption while maintaini...
Yang Liu, Tong Zhang, Keshab K. Parhi