Sciweavers

7065 search results - page 1058 / 1413
» Iterative Scheduling Algorithms
Sort
View
ICLP
2009
Springer
16 years 7 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 7 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
POPL
2004
ACM
16 years 7 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
ALT
2002
Springer
16 years 3 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
ICCD
2006
IEEE
275views Hardware» more  ICCD 2006»
16 years 3 months ago
Split-Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture
— A reduced complexity LDPC decoding method is presented that dramatically reduces wire interconnect complexity, which is a major issue in LDPC decoders. The proposed Split-Row m...
Tinoosh Mohsenin, Bevan M. Baas
« Prev « First page 1058 / 1413 Last » Next »