Sciweavers

1757 search results - page 230 / 352
» Concepts From Time Series
Sort
View
COCOA
2009
Springer
15 years 4 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
ISCAS
2005
IEEE
126views Hardware» more  ISCAS 2005»
15 years 3 months ago
Scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permutation
— The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units and ...
In-Cheol Park, Se-Hyeon Kang
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 2 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
AAAI
1997
14 years 11 months ago
Models of Continual Computation
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
Eric Horvitz
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 8 months ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey